226 search results - page 11 / 46 » Dynamic Variable Ordering in CSPs |
ICCAD
1999
IEEE
14 years 1 months ago
1999
IEEE
This paper proposes lazy group sifting for dynamic variable reordering during state traversal. The proposed method relaxes the idea of pairwise grouping of present state variables...
TNN
2008
13 years 9 months ago
2008
Abstract--This paper considers the approximation of sufficiently smooth multivariable functions with a multilayer perceptron (MLP). For a given approximation order explicit formula...
CP
2003
Springer
14 years 2 months ago
2003
Springer
Abstract. Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to de...
ECAI
2004
Springer
14 years 2 months ago
2004
Springer
Distributed constraint satisfaction, in its most general acceptation, involves a collection of agents solving local constraint satisfaction subproblems, and a communication protoco...
ECAI
2006
Springer
14 years 24 days ago
2006
Springer
A new search algorithm for solving distributed constraint optimization problems (DisCOPs) is presented. Agents assign variables sequentially and propagate their assignments asynchr...