Sciweavers

1051 search results - page 16 / 211
» Foundations of Constraint Satisfaction
Sort
View
CORR
2010
Springer
156views Education» more  CORR 2010»
14 years 9 months ago
The Exact Closest String Problem as a Constraint Satisfaction Problem
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...
Tom Kelsey, Lars Kotthoff
CP
2005
Springer
15 years 3 months ago
Solution Equivalent Subquadrangle Reformulations of Constraint Satisfaction Problems
Abstract. Subquadrangles are a natural way in which to represent constraints as they do not restrict any subset of their scope. There are already known methods for converting any g...
Chris Houghton, David A. Cohen
AAAI
1994
14 years 11 months ago
In Search of the Best Constraint Satisfaction Search
We present the results of an empirical study of several constraint satisfaction search algorithms and heuristics. Using a random problem generator that allows us to create instanc...
Daniel Frost, Rina Dechter
AIR
2005
111views more  AIR 2005»
14 years 9 months ago
An Arc-Consistency Algorithm for Dynamic and Distributed Constraint Satisfaction Problems
Abstract. This paper presents the new DDAC4 algorithm for dynamic arc consistency enforcement in distributed Constraint Satisfaction Problems. The algorithm is an adaptation of the...
Georg Ringwelski
ACST
2006
14 years 11 months ago
Experimental study of hybrid-type distributed maximal constraint satisfaction algorithm
A constraint satisfaction problem (CSP) is a general framework that can formalize various application problems in artificial intelligence. However, practical real-world problems t...
Masato Noto, Masahito Kurihara