Sciweavers

721 search results - page 107 / 145
» GRASP - evolution for constraint satisfaction problems
Sort
View
60
Voted
CP
2007
Springer
15 years 3 months ago
Solution Directed Backjumping for QCSP
In this paper we present new techniques for improving backtracking based Quantified Constraint Satisfaction Problem (QCSP) solvers. QCSP is a generalization of CSP in which variab...
Fahiem Bacchus, Kostas Stergiou
CP
2007
Springer
15 years 3 months ago
Exploiting Past and Future: Pruning by Inconsistent Partial State Dominance
It has recently been shown, for the Constraint Satisfaction Problem (CSP), that the state associated with a node of the search tree built by a backtracking algorithm can be exploit...
Christophe Lecoutre, Lakhdar Sais, Sébastie...
STDBM
2004
Springer
171views Database» more  STDBM 2004»
15 years 3 months ago
Extracting Mobility Statistics from Indexed Spatio-Temporal Datasets
With the recent progress of spatial information technologies and mobile computing technologies, spatio-temporal databases which store information on moving objects including vehicl...
Yoshiharu Ishikawa, Yuichi Tsukamoto, Hiroyuki Kit...
AAAI
2007
15 years 12 hour ago
Filtering, Decomposition and Search Space Reduction for Optimal Sequential Planning
We present in this paper a hybrid planning system which combines constraint satisfaction techniques and planning heuristics to produce optimal sequential plans. It integrates its ...
Stéphane Grandcolas, C. Pain-Barre
CP
2011
Springer
13 years 9 months ago
Pruning Rules for Constrained Optimisation for Conditional Preferences
A depth-first search algorithm can be used to find optimal solutions of a Constraint Satisfaction Problem (CSP) with respect to a set of conditional preferences statements (e.g.,...
Nic Wilson, Walid Trabelsi