346 search results - page 37 / 70 » Solving quantified constraint satisfaction problems |
JETAI
2008
15 years 14 days ago
2008
: This paper shows how the Asynchronous Backtracking (Yokoo et al., 1998) algorithm, a well known distributed constraint satisfaction algorithm, produces unnecessary messages and i...
84
Voted
CORR
2010
Springer
15 years 17 days ago
2010
Springer
We study the complexity of evaluating positive equality-free sentences of first-order (FO) logic over a fixed, finite structure B. This may be seen as a natural generalisation of ...
154
click to vote
CPAIOR
2010
Springer
14 years 10 months ago
2010
Springer
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
101
Voted
ANTSW
2008
Springer
15 years 2 months ago
2008
Springer
We propose to integrate ACO in a Constraint Programming (CP) language. Basically, we use the CP language to describe the problem to solve by means of constraints and we use the CP ...
CPC
2006
15 years 15 days ago
2006
Abstract. We show that a maximum cut of a random graph below the giantcomponent threshold can be found in linear space and linear expected time by a simple algorithm. In fact, the ...