Sciweavers

942 search results - page 23 / 189
» Distance Constraint Satisfaction Problems
Sort
View
IJCAI
2003
13 years 9 months ago
Splitting the atom: A new approach to Neighbourhood Interchangeability in Constraint Satisfaction Problems
We investigate interchangeability of values in CSPs, based on an approach where a single value in the domain of a variable can be treated as a combination of “sub-values”. An ...
James Bowen, Chavalit Likitvivatanavong
AAAI
1996
13 years 9 months ago
Enhancements of Branch and Bound Methods for the Maximal Constraint Satisfaction Problem
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...
Richard J. Wallace
ASP
2001
Springer
14 years 29 days ago
Tabular Constraint-Satisfaction Problems and Answer Set Programming
Raphael A. Finkel, Victor W. Marek, Miroslaw Trusz...
GECCO
2006
Springer
121views Optimization» more  GECCO 2006»
14 years 3 days ago
GRASP - evolution for constraint satisfaction problems
Manuel Cebrián, Iván Dotú