Sciweavers

980 search results - page 162 / 196
» Decentralized Constraint Satisfaction
Sort
View
ECAI
2004
Springer
14 years 22 days ago
Encoding Quantified CSPs as Quantified Boolean Formulae
Quantified Constraint Satisfaction Problems (QCSPs) are CSPs in which some variables are universally quantified. For each possible value of such variables, we have to find ways to ...
Ian P. Gent, Peter Nightingale, Andrew G. D. Rowle...
CP
2006
Springer
14 years 22 days ago
Mini-bucket Elimination with Bucket Propagation
Many important combinatorial optimization problems can be expressed as constraint satisfaction problems with soft constraints. When problems are too difficult to be solved exactly,...
Emma Rollon, Javier Larrosa
ECAI
2006
Springer
14 years 20 days ago
Decision with Uncertainties, Feasibilities, and Utilities: Towards a Unified Algebraic Framework
Several formalisms exist to express and solve decision problems. Each is designed to capture different kinds of knowledge: utilities expressing preferences, uncertainties on the en...
Cédric Pralet, Gérard Verfaillie, Th...
AAAI
2007
13 years 11 months ago
Nonmyopic Informative Path Planning in Spatio-Temporal Models
In many sensing applications we must continuously gather information to provide a good estimate of the state of the environment at every point in time. A robot may tour an environ...
Alexandra Meliou, Andreas Krause, Carlos Guestrin,...
HCI
2007
13 years 10 months ago
ParSketch: A Sketch-Based Interface for a 2D Parametric Geometry Editor
ParSketch is a software prototype to evaluate the usability and functionality of a sketching interface aimed at defining 2D parametric sections. Currently, ParSketch interprets str...
Ferran Naya, Manuel Contero, Nuria Aleixos, Pedro ...