Sciweavers

808 search results - page 60 / 162
» A scaling algorithm for polynomial constraint satisfaction p...
Sort
View
JAIR
2000
94views more  JAIR 2000»
14 years 9 months ago
Planning Graph as a (Dynamic) CSP: Exploiting EBL, DDB and other CSP Search Techniques in Graphplan
This paper reviews the connections between Graphplan's planning-graph and the dynamic constraint satisfaction problem and motivates the need for adapting CSP search technique...
Subbarao Kambhampati
AAIM
2008
Springer
94views Algorithms» more  AAIM 2008»
15 years 4 months ago
Speed Scaling with a Solar Cell
We consider the setting of a device that obtains it energy from a battery and some regenerative source such as a solar cell. We consider the speed scaling problem of scheduling a c...
Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs
AI
2008
Springer
14 years 9 months ago
Domain filtering consistencies for non-binary constraints
In non-binary constraint satisfaction problems, the study of local consistencies that only prune values from domains has so far been largely limited to generalized arc consistency...
Christian Bessiere, Kostas Stergiou, Toby Walsh
ICIP
1998
IEEE
15 years 11 months ago
Generalized Hermite Polynomials for Image Reconstruction from Zero Crossing Contours
Generalized Hermite polynomials in two variables are employed for the reconstruction of images from a knowledge of their zero crossing contours. The problem of reconstruction of s...
Y. V. Venkatesh
HEURISTICS
2002
152views more  HEURISTICS 2002»
14 years 9 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