Sciweavers

721 search results - page 77 / 145
» GRASP - evolution for constraint satisfaction problems
Sort
View
ECAI
2004
Springer
15 years 3 months ago
Boosting Systematic Search by Weighting Constraints
In this paper, we present a dynamic and adaptive variable ordering heuristic which guides systematic search toward inconsistent or hard parts of a Constraint Satisfaction Problem (...
Frédéric Boussemart, Fred Hemery, Ch...
CVPR
2008
IEEE
15 years 11 months ago
3D surface models by geometric constraints propagation
This paper proposes a technique for estimating piecewise planar models of objects from their images and geometric constraints. First, assuming a bounded noise in the localization ...
Michela Farenzena, Andrea Fusiello
JAL
2008
97views more  JAL 2008»
14 years 9 months ago
Experimental studies of variable selection strategies based on constraint weights
An important class of heuristics for constraint satisfaction problems works by sampling information during search in order to inform subsequent decisions. One of these strategies, ...
Richard J. Wallace, Diarmuid Grimes
JAIR
2010
145views more  JAIR 2010»
14 years 8 months ago
Fast Set Bounds Propagation Using a BDD-SAT Hybrid
Binary Decision Diagram (BDD) based set bounds propagation is a powerful approach to solving set-constraint satisfaction problems. However, prior BDD based techniques incur the si...
Graeme Gange, Peter J. Stuckey, Vitaly Lagoon
ICTAI
2009
IEEE
14 years 7 months ago
A Generalized Cyclic-Clustering Approach for Solving Structured CSPs
We propose a new method for solving structured CSPs which generalizes and improves the Cyclic-Clustering approach [4]. First, the cutset and the tree-decomposition of the constrai...
Cédric Pinto, Cyril Terrioux