Sciweavers

717 search results - page 30 / 72
» Weak-Commitment Search for Solving Constraint Satisfaction P...
Sort
View
110 views 164 votes 15 years 10 months ago  CP 2003»
This paper aims to show that Constraint Programming can be an efficient technique to solve a well-known combinatorial optimization problem: the search for a maximum clique in a gra...
69 views 138 votes 15 years 5 months ago  CSUR 2000»
: Constraint satisfaction programming (CSP) is a powerful paradigm for solving complex combinatorial problems, which has gained a lot of attention recently. Putting the power of co...
94 views 130 votes 15 years 11 months ago  SGAI 2007»
Constraint Satisfaction Problems can be solved using either iterative improvement or constructive search approaches. Iterative improvement techniques converge quicker than the cons...
110 views 171 votes 15 years 11 months ago  CP 2007»
Abstract. Constraint satisfaction and propositional satisfiability problems are often solved using backtracking search. Previous studies have shown that a technique called randomi...
124 views 137 votes 15 years 6 months ago  ATAL 2010»
We present a fully distributed multi-agent planning algorithm. Our methodology uses distributed constraint satisfaction to coordinate between agents, and local planning to ensure ...
125 views 162 votes 15 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 views 166 votes 15 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 views 145 votes 15 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 views 148 votes 15 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...
135 views 147 votes 15 years 9 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...