717 search results - page 108 / 144 » Weak-Commitment Search for Solving Constraint Satisfaction P... |
CP
2008
Springer
14 years 11 months ago
2008
Springer
ctural abstractions that were introduced in [17]. Compared with other symmetry-breaking techniques, the big advantage of dynamic symmetry breaking is that it can accommodate dynami...
ICDCS
1999
IEEE
15 years 2 months ago
1999
IEEE
To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of...
EOR
2010
14 years 10 months ago
2010
This study investigates an optimization-based heuristic for the Robotic Cell Problem. This problem arises in automated cells and is a complex ow shop problem with a single transpo...
DSS
2008
14 years 9 months ago
2008
The Web is a universal repository of human knowledge and culture which has allowed unprecedented sharing of ideas and information in a scale never seen before. It can also be cons...
ATAL
2008
Springer
14 years 11 months ago
2008
Springer
Distributed Constraint Optimization (DCOP) is a key technique for solving multiagent coordination problems. Unfortunately, finding minimal-cost DCOP solutions is NP-hard. We there...