1197 search results - page 39 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
ICCBR
2005
Springer
14 years 2 months ago
2005
Springer
Constraint programming is a powerful paradigm that offers many different strategies for solving problems. Choosing a good strategy is difficult; choosing a poor strategy wastes r...
ICAI
2010
13 years 7 months ago
2010
- In this article, we present an algorithm which is capable of transforming a gridded dogleg channel routing problem into a constraint programming (CP) problem. The transformed CP ...
TAPSOFT
1997
Springer
14 years 1 months ago
1997
Springer
Abstract. We present a new constraint system called INES. Its constraints are conjunctions of inclusions t1 t2 between rst-order terms (without set operators) which are interpreted...
ICRA
2009
IEEE
14 years 3 months ago
2009
IEEE
Abstract— We present a novel approach to compute collisionfree paths for multiple robots subject to local coordination constraints. More specifically, given a set of robots, the...
TASE
2010
IEEE
13 years 4 months ago
2010
IEEE
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...