717 search results - page 31 / 144 » Weak-Commitment Search for Solving Constraint Satisfaction P... |
ATAL
2007
Springer
15 years 4 months ago
2007
Springer
This paper presents a novel, unified distributed constraint satisfaction framework based on automated negotiation. The Distributed Constraint Satisfaction Problem (DCSP) is one t...
AAAI
1996
14 years 11 months ago
1996
Two methods are described for enhancing performance of branch and bound methods for overconstrained CSPS. These methods improve either the upper or lower bound, respectively, duri...
DSOM
2004
Springer
15 years 3 months ago
2004
Springer
In this paper, we describe an approach for automatically generating configurations for complex applications. Automated generation of system co nfigurations is required to allow lar...
CSCLP
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. In this paper we develop a localized value-ordering heuristic for distributed resource allocation problems. We show how this value ordering heuristics can be used to achi...
CEC
2009
IEEE
15 years 1 months ago
2009
IEEE
Evolutionary algorithms have employed the SAW (Stepwise Adaptation of Weights) method in order to solve CSPs (Constraint Satisfaction Problems). This method originated in hill-clim...