Sciweavers

717 search results - page 31 / 72
» Weak-Commitment Search for Solving Constraint Satisfaction P...
Sort
View
125 views 126 votes 15 years 7 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 views 128 votes 15 years 2 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 views 114 votes 15 years 7 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 views 118 votes 15 years 7 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...
135 views 108 votes 15 years 5 months ago  CEC 2009»
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 views 120 votes 15 years 8 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 views 116 votes 15 years 7 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...
149 views 192 votes 16 years 2 months ago  CP 2009»
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...
117 views 101 votes 15 years 1 months ago  AI 2005»
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...
142 views 197 votes 16 years 2 months ago  CP 2009»
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...