18 search results - page 2 / 4 » Retroactive Ordering for Dynamic Backtracking |
ECAI
2008
Springer
13 years 6 months ago
2008
Springer
We propose a new algorithm for solving Distributed Constraint Optimization Problems (DCOPs). Our algorithm, called DyBop, is based on branch and bound search with dynamic ordering ...
KR
1992
Springer
13 years 8 months ago
1992
Springer
This paper studies a version of the job shop scheduling problem in which some operations have to be scheduled within non-relaxable time windows i.e. earliest latest possible start...
JAIR
2000
13 years 4 months ago
2000
This paper reviews the connections between Graphplan's planning-graph and the dynamic constraint satisfaction problem and motivates the need for adapting CSP search technique...
AUSAI
2003
Springer
13 years 10 months ago
2003
Springer
The distributed constraint satisfaction problem (CSP) is a general formalisation used to represent problems in distributed multiagent systems. To deal with realistic problems, mult...
CONCUR
2008
Springer
13 years 6 months ago
2008
Springer
We present an algorithm for partial order reduction in the context of a countable universe of deterministic actions, of which finitely many are enabled at any given state. This mea...