Sciweavers

1300 search results - page 124 / 260
» Constraint satisfaction problems and global cardinality cons...
Sort
View
CP
2007
Springer
15 years 4 months ago
A Generic Geometrical Constraint Kernel in Space and Time for Handling Polymorphic k-Dimensional Objects
: This report introduces a geometrical constraint kernel for handling the location in space and time of polymorphic k-dimensional objects subject to various geometrical and time co...
Nicolas Beldiceanu, Mats Carlsson, Emmanuel Poder,...
CVPR
2006
IEEE
15 years 12 months ago
Shape from Shading: Recognizing the Mountains through a Global View
Resolving local ambiguities is an important issue for shape from shading (SFS). Pixel ambiguities of SFS can be eliminated by propagation approaches. However, patch ambiguities st...
Qihui Zhu, Jianbo Shi
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
BIRTHDAY
2005
Springer
15 years 3 months ago
Agents with Exact Foreknowledge
Computational experiments are reported involving the concept of foreknowledge, an agent’s direct, unmediated and accurate, but possibly incomplete, awareness of its future includ...
Jim Doran
AISC
2004
Springer
15 years 3 months ago
New Developments in Symmetry Breaking in Search Using Computational Group Theory
Symmetry-breaking in constraint satisfaction problems (CSPs) is a well-established area of AI research which has recently developed strong interactions with symbolic computation, i...
Tom Kelsey, Steve Linton, Colva M. Roney-Dougal