125 views162 votes15 years 11 months ago ATAL 2007»
This paper presents a novel, unified distributed constraint satisfaction framework based on automated negotiation. The Distributed Constraint Satisfaction Problem (DCSP) is one t...
119 views166 votes15 years 6 months ago AAAI 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...
124 views145 votes15 years 10 months ago DSOM 2004»
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...
101 views148 votes15 years 10 months ago CSCLP 2004»
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...
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...
123 views159 votes15 years 12 months ago CSE 2009»
—Constraint satisfaction has been a very successful paradigm for solving problems such as resource allocation and planning. Many of these problems pose themselves in a context in...
146 views146 votes15 years 11 months ago ATAL 2007»
We formulate the problem of computing equilibria in multiplayer games represented by arbitrary undirected graphs as a constraint satisfaction problem and present two algorithms. T...
Abstract. We address a location-allocation problem that requires deciding the location of a set of facilities, the allocation of customers to those facilities under facility capaci...
We present a new series of distributed constraint satisfaction algorithms, the distributed breakout algorithms, which is inspired by local search algorithms for solving the constr...
Abstract. In this paper, we show how model-checking can be generalized to temporal logic constraint solving, by considering temporal logic formulae with free variables over some do...