 | 2009 |
|---|
| 11 |       | Pavel Surynek:
Towards Shorter Solutions for Problems of Path Planning for Multiple Robots in Theta-like Environments.
FLAIRS Conference 2009 |
| 2008 |
|---|
| 10 | | Pavel Surynek:
Tractable Class of a Problem of Goal Satisfaction in Mutual Exclusion Network.
FLAIRS Conference 2008: 561-566 |
| 9 | | Pavel Surynek:
Domain-Dependent View of Multiple Robots Path Planning.
STAIRS 2008: 175-186 |
| 2007 |
|---|
| 8 |  | Pavel Surynek:
A Global Filtration for Satisfying Goals in Mutual Exclusion Networks.
CSCLP 2007: 142-157 |
| 7 | | Pavel Surynek,
Roman Barták:
Maintaining Arc-Consistency over Mutex Relations in Planning Graphs during Search.
FLAIRS Conference 2007: 134-139 |
| 6 | | Pavel Surynek,
Lukás Chrpa,
Jirí Vyskocil:
Solving Difficult Problems by Viewing them as Structured Dense Graphs.
IICAI 2007: 84-103 |
| 5 | | Lukás Chrpa,
Pavel Surynek,
Jirí Vyskocil:
Encoding of Planning Problems and Their Optimizations in Linear Logic.
INAP/WLP 2007: 54-68 |
| 4 | | Pavel Surynek:
Solving Difficult SAT Instances Using Greedy Clique Decomposition.
SARA 2007: 359-374 |
| 2005 |
|---|
| 3 | | Pavel Surynek,
Roman Barták:
Encoding HTN Planning as a Dynamic CSP.
CP 2005: 868 |
| 2 | | Roman Barták,
Pavel Surynek:
An Improved Algorithm for Maintaining Arc Consistency in Dynamic Constraint Satisfaction Problems.
FLAIRS Conference 2005: 161-166 |
| 2004 |
|---|
| 1 | | Pavel Surynek,
Roman Barták:
A New Algorithm for Maintaining Arc Consistency After Constraint Retraction.
CP 2004: 767-771 |
