717 search results - page 41 / 144 » Weak-Commitment Search for Solving Constraint Satisfaction P... |
CP
1995
Springer
15 years 1 months ago
1995
Springer
We present a method for finding optimal partial solutions to overconstrained instances of the Disjunctive Temporal Problems (DTP). The solutions are optimal in that they satisfy ...
AIMSA
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. The problem of curriculum-based course timetabling is studied in this work. In addition to formally defining the problem, we present a hybrid solution algorithm (Adaptiv...
AAAI
2006
14 years 11 months ago
2006
We present a new formulation of distributed task assignment, called Generalized Mutual Assignment Problem (GMAP), which is derived from an NP-hard combinatorial optimization probl...
IEAAIE
2001
Springer
15 years 2 months ago
2001
Springer
Scheduling problems can be seen as a set of temporal metric and disjunctive constraints. So, they can be formulated in terms of CSPs techniques. In the literature, there are CSP-b...
104
click to vote
AUSAI
2008
Springer
14 years 11 months ago
2008
Springer
Planning collision-free paths for multiple robots traversing a shared space is a problem that grows combinatorially with the number of robots. The naive centralised approach soon ...