Sciweavers

235 search results - page 14 / 47
» An efficient consistency algorithm for the Temporal Constrai...
Sort
View
CORR
2008
Springer
76views Education» more  CORR 2008»
13 years 7 months ago
An Efficient Algorithm for a Sharp Approximation of Universally Quantified Inequalities
This paper introduces a new algorithm for solving a subclass of quantified constraint satisfaction problems (QCSP) where existential quantifiers precede universally quantified ine...
Alexandre Goldsztejn, Claude Michel, Michel Rueher
AAAI
2010
13 years 9 months ago
A First Practical Algorithm for High Levels of Relational Consistency
Consistency properties and algorithms for achieving them are at the heart of the success of Constraint Programming. In this paper, we study the relational consistency property R(,...
Shant Karakashian, Robert J. Woodward, Christopher...
HEURISTICS
2002
152views more  HEURISTICS 2002»
13 years 7 months ago
A Constraint-Based Method for Project Scheduling with Time Windows
This paper presents a heuristic algorithm for solving RCPSP/max, the resource constrained project scheduling problem with generalized precedence relations. The algorithm relies, a...
Amedeo Cesta, Angelo Oddi, Stephen F. Smith
CSCLP
2006
Springer
13 years 11 months ago
Extracting Microstructure in Binary Constraint Networks
Abstract. We present algorithms that perform the extraction of partial assignments from binary Constraint Satisfaction Problems without introducing new constraints. They are based ...
Chavalit Likitvivatanavong, Roland H. C. Yap
CIE
2007
Springer
14 years 1 months ago
Computational Complexity of Constraint Satisfaction
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
Heribert Vollmer