Sciweavers

32 search results - page 4 / 7
» Relaxations of semiring constraint satisfaction problems
Sort
View
IJCAI
2001
13 years 10 months ago
A Constraint Satisfaction Approach to Parametric Differential Equations
Parametric ordinary differential equations arise in many areas of science and engineering. Since some of the data is uncertain and given by intervals, traditional numerical method...
Micha Janssen, Pascal Van Hentenryck, Yves Deville
CVPR
2008
IEEE
14 years 11 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
CP
2001
Springer
14 years 1 months ago
Optimal Pruning in Parametric Differential Equations
Initial value problems for parametric ordinary differential equations (ODEs) arise in many areas of science and engineering. Since some of the data is uncertain, traditional numer...
Micha Janssen, Pascal Van Hentenryck, Yves Deville
CCIA
2005
Springer
14 years 2 months ago
A Preliminary Study on the Relaxation of Numeric Features in Planning
Modern AI planners use different strategies to simplify the complexity of current planning problems and turn them more affordable. In this paper, we present a new approach that div...
Antonio Garrido, Eva Onaindia, Donato Herná...
CP
2008
Springer
13 years 10 months ago
Solving a Telecommunications Feature Subscription Configuration Problem
Abstract. Call control features (e.g., call-divert, voice-mail) are primitive options to which users can subscribe off-line to personalise their service. The configuration of a fea...
David Lesaint, Deepak Mehta, Barry O'Sullivan, Lui...