Sciweavers

383 search results - page 18 / 77
» Common Subexpressions in Constraint Models of Planning Probl...
Sort
View
AAAI
2006
13 years 9 months ago
Acquiring Constraint Networks Using a SAT-based Version Space Algorithm
Constraint programming is a commonly used technology for solving complex combinatorial problems. However, users of this technology need significant expertise in order to model the...
Christian Bessière, Remi Coletta, Fré...
AMAI
1999
Springer
13 years 7 months ago
Logic Programs with Stable Model Semantics as a Constraint Programming Paradigm
Logic programming with the stable model semantics is put forward as a novel constraint programming paradigm. This paradigm is interesting because it bring advantages of logic prog...
Ilkka Niemelä
ECAI
2008
Springer
13 years 9 months ago
Towards Efficient Belief Update for Planning-Based Web Service Composition
At the "functional level", Semantic Web Services (SWS) are described akin to planning operators, with preconditions and effects relative to an ontology; the ontology prov...
Jörg Hoffmann
AINA
2010
IEEE
14 years 21 days ago
Mobile Element Path Planning for Time-Constrained Data Gathering in Wireless Sensor Networks
— We consider the problem of gathering data from a sensor network using mobile elements. In particular, we consider the case where the data are produced by measurements and need ...
Khaled Almiani, Anastasios Viglas, Lavy Libman
ICRA
2008
IEEE
197views Robotics» more  ICRA 2008»
14 years 2 months ago
A Bayesian framework for optimal motion planning with uncertainty
— Modeling robot motion planning with uncertainty in a Bayesian framework leads to a computationally intractable stochastic control problem. We seek hypotheses that can justify a...
Andrea Censi, Daniele Calisi, Alessandro De Luca, ...