1197 search results - page 56 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
CPAIOR
2006
Springer
14 years 1 months ago
2006
Springer
We define the timetable constrained distance minimization problem (TCDMP) which is a sports scheduling problem applicable for tournaments where the total travel distance must be mi...
CONSTRAINTS
2007
13 years 9 months ago
2007
In this paper we present Cardinal, a general finite sets constraint solver just made publicly available in ECLiPSe Prolog, suitable for combinatorial problem solving by exploiting ...
AUSAI
2008
Springer
13 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 ...
ICDT
2010
ACM
14 years 1 months ago
2010
ACM
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
ICICIC
2006
IEEE
14 years 3 months ago
2006
IEEE
In timetable scheduling problems, examination subjects must be slotted to certain times that satisfy several of constraints. They are NP-completeness problems, which usually lead ...