Sciweavers

717 search results - page 4 / 72
» Weak-Commitment Search for Solving Constraint Satisfaction P...
Sort
View
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 114 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...
173 views 126 votes 15 years 6 months ago  TIME 2002»
Local search techniques have attracted considerable interest in the Artificial Intelligence (AI) community since the development of GSAT [9] and the min-conflicts heuristic [5] ...
156 views 93 votes 15 years 1 months ago  CORR 2010»
We report (to our knowledge) the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration o...
130 views 118 votes 14 years 12 months ago  JAIR 2010»
Diagrammatic reasoning (DR) is pervasive in human problem solving as a powerful adjunct to symbolic reasoning based on language-like representations. The research reported in this...
168 views 133 votes 15 years 6 months ago  AMAI 2004»
This paper presents new look-ahead schemes for backtracking search when solving constraint satisfaction problems. The look-ahead schemes compute a heuristic for value ordering and...
87 views 83 votes 15 years 6 months ago  CP 2003»
We provide a reformulation of the constraint hierarchies (CHs) framework based on the notion of error indicators. Adapting the generalized view of local consistency in semiring-ba...