717 search results - page 27 / 144 » Weak-Commitment Search for Solving Constraint Satisfaction P... |
111
click to vote
FLAIRS
2008
15 years 2 days ago
2008
Constraint satisfaction techniques are commonly used for solving scheduling problems, still they are rare in AI planning. Although there are several attempts to apply constraint s...
AAAI
1994
14 years 11 months ago
1994
We present the results of an empirical study of several constraint satisfaction search algorithms and heuristics. Using a random problem generator that allows us to create instanc...
AMC
2008
14 years 10 months ago
2008
Abstract Nowadays many real problems can be modelled as Constraint Satisfaction Problems (CSPs). A search algorithm for constraint programming requires an order in which variables ...
NOMS
2000
IEEE
15 years 2 months ago
2000
IEEE
Communication networks are expected to offer a wide range of services to an increasingly large number of users, with a diverse range of quality of service. This calls for efficien...
ICCD
2007
IEEE
15 years 6 months ago
2007
IEEE
We present new techniques for explicit constraint satisfaction in the incremental placement process. Our algorithm employs a Lagrangian Relaxation (LR) type approach in the analyt...