1197 search results - page 37 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
CP
2000
Springer
14 years 1 months ago
2000
Springer
Most of complete search algorithms over Constraint Satisfaction Problems (csp) are based on Standard Backtracking. Two main enhancements of this basic scheme have been proposed : r...
AAAI
2006
13 years 10 months ago
2006
Constraint programming is a commonly used technology for solving complex combinatorial problems. However, users of this technology need significant expertise in order to model the...
NPC
2004
Springer
14 years 2 months ago
2004
Springer
This paper is motivated by the problem of poor searching efficiency in decentralized peer-to-peer file-sharing systems. We solve the searching problem by considering and modeling t...
CA
2002
IEEE
14 years 2 months ago
2002
IEEE
This paper presents a new method for editing an existing motion to satisfy a set of user-specified constraints, and in doing so guaranteeing the kinematic and dynamic soundness o...
CONSTRAINTS
2010
13 years 9 months ago
2010
AND/OR search spaces accommodate advanced algorithmic schemes for graphical models which can exploit the structure of the model. We extend and evaluate the depth-first and best-fi...