2009 |
48 | EE | Michal Zerola,
Jerome Lauret,
Roman Barták,
Michal Sumbera:
Using constraint programming to resolve the multi-source/multi-site data movement paradigm on the Grid
CoRR abs/0901.0148: (2009) |
2008 |
47 | EE | Roman Barták,
Ondrej Cepek:
Nested Precedence Networks with Alternatives: Recognition, Tractability, and Models.
AIMSA 2008: 235-246 |
46 | | Roman Barták,
Daniel Toropila:
Reformulating Constraint Models for Classical Planning.
FLAIRS Conference 2008: 525-530 |
45 | | Lukás Chrpa,
Roman Barták:
Towards Getting Domain Knowledge: Plans Analysis through Investigation of Actions Dependencies.
FLAIRS Conference 2008: 531-536 |
44 | EE | Roman Barták,
Ondrej Cepek:
Nested temporal networks with alternatives: recognition and tractability.
SAC 2008: 156-157 |
43 | EE | Lukás Chrpa,
Roman Barták:
Looking for Planning Problems Solvable in Polynomial Time via Investigation of Structures of Action Dependencies.
SCAI 2008: 175-180 |
42 | EE | Roman Barták:
Rina Dechter , Constraint Processing, Morgan Kaufmann Publisher (2003) ISBN 1-55860-890-7, Francesca Rossi, Peter van Beek and Toby Walsh, Editors, Handbook of Constraint Programming, Elsevier (2006) ISBN 978-0-444-52726-4.
Computer Science Review 2(2): 123-130 (2008) |
41 | EE | Roman Barták,
Ondrej Cepek:
Incremental Filtering Algorithms for Precedence and Dependency Constraints.
International Journal on Artificial Intelligence Tools 17(1): 205-221 (2008) |
2007 |
40 | EE | Roman Barták,
Ondrej Cepek,
Martin Hejna:
Temporal Reasoning in Nested Temporal Networks with Alternatives.
CSCLP 2007: 17-31 |
39 | | Pavel Surynek,
Roman Barták:
Maintaining Arc-Consistency over Mutex Relations in Planning Graphs during Search.
FLAIRS Conference 2007: 134-139 |
38 | | Roman Barták,
Ondrej Cepek:
Temporal Networks with Alternatives: Complexity and Model.
FLAIRS Conference 2007: 641-646 |
37 | EE | Roman Barták:
Generating Implied Boolean Constraints Via Singleton Consistency.
SARA 2007: 50-63 |
36 | EE | Roman Barták,
Lee McCluskey:
Introduction to the Special Issue on Knowledge Engineering Tools and Techniques for Automated Planning and Scheduling Systems.
Knowledge Eng. Review 22(2): 115-116 (2007) |
2006 |
35 | EE | Roman Barták,
Ondrej Cepek:
A Constraint Model for State Transitions in Disjunctive Resources.
CSCLP 2006: 48-62 |
34 | | Roman Barták:
Incremental Propagation of Time Windows on Disjunctive Resources.
FLAIRS Conference 2006: 25-30 |
33 | | Roman Barták,
Ondrej Cepek:
Incremental Maintenance of Double Precedence Graphs: A Constraint-Based Approach.
ICAPS 2006: 350-353 |
32 | EE | Roman Barták,
Ondrej Cepek:
Incremental Filtering Algorithms for Precedence and Dependency Constraints.
ICTAI 2006: 416-426 |
31 | | Roman Barták,
Lee McCluskey:
The First Competition on Knowledge Engineering for Planning and Scheduling.
AI Magazine 27(1): 97-98 (2006) |
30 | EE | Roman Barták,
Michela Milano:
Introduction to the Special Issue on the Integration of AI and OR Techniques in CP for Combinatorial Optimization (CPAIOR 2005).
Constraints 11(4): 269-270 (2006) |
2005 |
29 | | Roman Barták,
Michela Milano:
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, Second International Conference, CPAIOR 2005, Prague, Czech Republic, May 30 - June 1, 2005, Proceedings
Springer 2005 |
28 | EE | Pavel Cejnar,
Roman Barták:
Automated Search for Heuristic Functions.
CP 2005: 843 |
27 | EE | Pavel Surynek,
Roman Barták:
Encoding HTN Planning as a Dynamic CSP.
CP 2005: 868 |
26 | EE | Josef Zlomek,
Roman Barták:
Full Arc Consistency in WCSP and in Constraint Hierarchies with Finite Domains.
CP 2005: 876 |
25 | EE | Roman Barták:
On Generators of Random Quasigroup Problems.
CSCLP 2005: 164-178 |
24 | | Roman Barták,
Pavel Surynek:
An Improved Algorithm for Maintaining Arc Consistency in Dynamic Constraint Satisfaction Problems.
FLAIRS Conference 2005: 161-166 |
23 | | Marius-Calin Silaghi,
Amit Abhyankar,
Markus Zanker,
Roman Barták:
Desk-Mates (Stable Matching) with Privacy of Preferences, and a New Distributed CSP Framework.
FLAIRS Conference 2005: 671-677 |
22 | EE | Roman Barták,
Hana Rudová:
Limited assignments: a new cutoff strategy for incomplete depth-first search.
SAC 2005: 388-392 |
21 | EE | Roman Barták:
R. Dechter, Constraint Processing, Morgan Kaufmann (2003).
Artif. Intell. 169(2): 142-145 (2005) |
20 | EE | Petr Vilím,
Roman Barták,
Ondrej Cepek:
Extension of O(n log n) Filtering Algorithms for the Unary Resource Constraint to Optional Activities.
Constraints 10(4): 403-425 (2005) |
2004 |
19 | EE | Petr Vilím,
Roman Barták,
Ondrej Cepek:
Unary Resource Constraint with Optional Activities.
CP 2004: 62-76 |
18 | EE | Pavel Surynek,
Roman Barták:
A New Algorithm for Maintaining Arc Consistency After Constraint Retraction.
CP 2004: 767-771 |
17 | | Roman Barták,
Radek Erben:
A New Algorithm for Singleton Arc Consistency.
FLAIRS Conference 2004 |
16 | EE | Roman Barták:
Effective Modeling with Constraints.
INAP/WLP 2004: 149-165 |
15 | EE | Tomás Müller,
Hana Rudová,
Roman Barták:
Minimal Perturbation Problem in Course Timetabling.
PATAT 2004: 126-146 |
14 | EE | Roman Barták:
The CP-04 Workshop on CSP Techniques with Immediate Application (Conference Report).
IEEE Intelligent Informatics Bulletin 4: 3 (2004) |
2003 |
13 | EE | Roman Barták,
Tomás Müller,
Hana Rudová:
A New Approach to Modeling and Solving Minimal Perturbation Problems.
CSCLP 2003: 233-249 |
12 | EE | Roman Barták,
Roman Mecl:
Implementing Propagators for Tabular Constraints.
CSCLP 2003: 44-65 |
11 | EE | Roman Barták:
Dynamic Global Constraints in Backtracking Based Environments.
Annals OR 118(1-4): 101-119 (2003) |
2002 |
10 | | Petr Vilím,
Roman Barták:
Filtering Algorithms for Batch Processing with Sequence Dependent Setup Times.
AIPS 2002: 312-321 |
9 | EE | Roman Barták:
Visopt ShopFloor: On the Edge of Planning and Scheduling.
CP 2002: 587-602 |
8 | | Roman Barták:
A Theoretical Framework for Constraint Hierarchy Solvers.
ECAI 2002: 146-150 |
7 | EE | Roman Barták:
Visopt ShopFloor: Going Beyond Traditional Scheduling.
International Workshop on Constraint Solving and Constraint Logic Programming 2002: 185-199 |
6 | EE | Roman Barták:
Modelling Resource Transitions in Constraint-Based Scheduling.
SOFSEM 2002: 186-194 |
2001 |
5 | EE | Tomás Müller,
Roman Barták:
Interactive Timetabling
CoRR cs.PL/0109022: (2001) |
4 | EE | Roman Barták:
Dynamic Global Constraints: A First View
CoRR cs.PL/0109025: (2001) |
3 | EE | Krzysztof R. Apt,
Roman Barták,
Eric Monfroy,
Francesca Rossi,
Sebastian Brand:
Proceedings of the 6th Annual Workshop of the ERCIM Working Group on Constraints
CoRR cs.PL/0110012: (2001) |
2000 |
2 | EE | Roman Barták:
Conceptual Models for Combined Planning and Scheduling.
Electronic Notes in Discrete Mathematics 4: 1 (2000) |
1999 |
1 | EE | Roman Barták:
Dynamic Constraint Models for Planning and Scheduling Problems.
New Trends in Constraints 1999: 237-255 |