Sciweavers

717 search results - page 27 / 72
» Weak-Commitment Search for Solving Constraint Satisfaction P...
Sort
View
153 views 133 votes 15 years 3 months ago  FLAIRS 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...
95 views 94 votes 15 years 2 months ago  AAAI 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...
106 views 101 votes 15 years 1 months ago  AMC 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 ...
141 views 88 votes 15 years 5 months ago  NOMS 2000»
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...
183 views 101 votes 15 years 10 months ago  ICCD 2007»
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...
146 views 118 votes 15 years 1 months ago  HEURISTICS 2002»
This paper presents operators searching large neighborhoods in order to solve the vehicle routing problem. They make use of the pruning and propagation techniques of constraint pr...
149 views 104 votes 15 years 5 months ago  HICSS 1994»
We are developing a new problem-solving methodology based on a self-organization paradigm. To realize our future goal of self-organizing computational systems, we have to study co...
163 views 101 votes 15 years 3 months ago  CIKM 2008»
This demonstration presents the concepts, design, and implementation of SCDE, a relational database systems extended with the ability to solve constraint satisfaction problems (CS...
127 views 136 votes 15 years 2 months ago  AAAI 1996»
Learning during backtrack search is a space-intensive process that records information (such as additional constraints) in order to avoid redundant work. In this paper, we analyze...
145 views 113 votes 15 years 6 months ago  HM 2009»
We present a hybrid solver (called GELATO) that exploits the potentiality of a Constraint Programming (CP) environment (Gecode) and of a Local Search (LS) framework (EasyLocal++ )....