2109 search results - page 110 / 422 » Solving Necklace Constraint Problems |
151
click to vote
ICRA
2009
IEEE
15 years 11 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...
160
click to vote
FLAIRS
2007
15 years 7 months ago
2007
Using information from failures to guide subsequent search is an important technique for solving combinatorial problems in domains such as boolean satisfiability (SAT) and constr...
139
click to vote
ECAI
2008
Springer
15 years 6 months ago
2008
Springer
Constraint satisfaction problems (CSPs) are ubiquitous in many real-world contexts. However, modeling a problem as a CSP can be very challenging, usually requiring considerable ex...
182
click to vote
ATAL
2008
Springer
15 years 7 months ago
2008
Springer
Distributed constraint optimization (DCOP) is a promising approach to coordination, scheduling and task allocation in multi agent networks. In large-scale or low-bandwidth network...
142
Voted
EAAI
2008
15 years 5 months ago
2008
The criterion of total weighted completion time occurs as a sub-problem of combinatorial optimization problems in such diverse areas as scheduling, container loading and storage a...