Sciweavers

711 search results - page 88 / 143
» Amalgams of Constraint Satisfaction Problems
Sort
View
CVPR
2008
IEEE
16 years 6 months ago
High-arity interactions, polyhedral relaxations, and cutting plane algorithm for soft constraint optimisation (MAP-MRF)
LP relaxation approach to soft constraint optimisation (i.e. MAP-MRF) has been mostly considered only for binary problems. We present its generalisation to n-ary problems, includi...
Tomás Werner
CONSTRAINTS
2008
107views more  CONSTRAINTS 2008»
15 years 4 months ago
A Constraint-Based Autonomous 3D Camera System
Camera control techniques for Interactive Digital Entertainment (IDE) are reaching their limits in terms of capabilities. To enable future growth, new methods must be derived to a...
Owen Bourne, Abdul Sattar, Scott D. Goodwin
CSCLP
2007
Springer
15 years 10 months ago
A Comparison of the Notions of Optimality in Soft Constraints and Graphical Games
The notion of optimality naturally arises in many areas of applied mathematics and computer science concerned with decision making. Here we consider this notion in the context of ...
Krzysztof R. Apt, Francesca Rossi, Kristen Brent V...
SARA
2009
Springer
15 years 11 months ago
Integrating Constraint Models for Sequential and Partial-Order Planning
Classical planning deals with finding a (shortest) sequence of actions transferring the world from its initial state to a state satisfying the goal condition. Traditional planning...
Roman Barták, Daniel Toropila
GLOBECOM
2008
IEEE
15 years 11 months ago
Guaranteed Boxed Localization in MANETs by Interval Analysis and Constraints Propagation Techniques
Abstract—In this contribution, we propose an original algorithm for self-localization in mobile ad-hoc networks. The proposed technique, based on interval analysis, is suited to ...
Farah Mourad, Hichem Snoussi, Fahed Abdallah, C&ea...