Sciweavers

717 search results - page 3 / 72
» Weak-Commitment Search for Solving Constraint Satisfaction P...
Sort
View
158 views 116 votes 15 years 5 months ago  GECCO 1999»
In this paper, we discuss the adaptability of Coevolutionary Genetic Algorithms on dynamic environments. Our CGA consists of two populations: solution-level one and schema-level o...
251 views 167 votes 14 years 4 months ago  PROCEDIA 2011»
We report the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration of symbol occurrenc...
116 views 116 votes 15 years 5 months ago  ECAI 2000»
Abstract. We describe in this paper Ant-P-solver, a generic constraint solver based on the Ant Colony Optimization (ACO) metaheuristic. The ACO metaheuristic takes inspiration on t...
150 views 137 votes 15 years 6 months ago  AISC 2004»
Nonlinear constraint systems can be solved by combining consistency techniques and search. In this approach, the search space is reduced using local reasoning on constraints. Howev...
116 views 122 votes 15 years 2 months ago  IJCAI 2003»
We present an algorithm Pref-AC that limits arc consistency (AC) to the preferred choices of a tree search procedure and that makes constraint solving more efficient without chan...
158 views 94 votes 15 years 7 months ago  GECCO 2005»
This paper proposes an incremental approach for building solutions using evolutionary computation. It presents a simple evolutionary model called a Transition model in which parti...
120 views 91 votes 15 years 6 months ago  ECAI 2004»
Many decision problems can be modelled as adversarial constraint satisfaction, which allows us to integrate methods from AI game playing. In particular, by using the idea of oppone...
85 views 113 votes 15 years 1 months ago  AMAI 1999»
The paper focuses on evaluating constraint satisfaction search algorithms on application based random problem instances. The application we use is a well-studied problem in the el...
121 views 131 votes 15 years 5 months ago  ICDCS 2000»
We present resolvent-based learning as a new nogood learning method for a distributed constraint satisfaction algorithm. This method is based on a look-back technique in constrain...
357 views 201 votes 16 years 11 months ago
"Constraint satisfaction is a general problem in which the goal is to find values for a set of variables that will satisfy a given set of constraints. It is the core of many a...