1197 search results - page 39 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
155
Voted
ICCBR
2005
Springer
15 years 10 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...
177
Voted
ICAI
2010
15 years 3 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 ...
155
click to vote
TAPSOFT
1997
Springer
15 years 9 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...
158
Voted
ICRA
2009
IEEE
16 years 14 hour 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...
215
click to vote
TASE
2010
IEEE
15 years 2 days 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...