Sciweavers

2109 search results - page 48 / 422
» Solving Necklace Constraint Problems
Sort
View
EAAI
2010
86views more  EAAI 2010»
15 years 4 months ago
Resolution of nonlinear interval problems using symbolic interval arithmetic
: An interval problem is a problem where the unknown variables take interval values. Such a problem can be defined by interval constraints, such as "the interval [a, b] [a, b...
Luc Jaulin, Gilles Chabert
CP
2004
Springer
15 years 9 months ago
Decomposition and Learning for a Hard Real Time Task Allocation Problem
Abstract. We present a cooperation technique using an accurate management of nogoods to solve a hard real-time problem which consists in assigning periodic tasks to processors in t...
Hadrien Cambazard, Pierre-Emmanuel Hladik, Anne-Ma...
JFP
2008
97views more  JFP 2008»
15 years 3 months ago
HM(X) type inference is CLP(X) solving
The HM(X) system is a generalization of the Hindley/Milner system parameterized in the constraint domain X. Type inference is performed by generating constraints out of the progra...
Martin Sulzmann, Peter J. Stuckey
SAC
2008
ACM
15 years 3 months ago
A constraint hierarchies approach to geometric constraints on sketches
We propose an approach that uses preferences on the constraints in order to deal with over-constrained geometric constraint problems. This approach employs constraint hierarchies,...
Christophe Jermann, Hiroshi Hosobe
ECML
2005
Springer
15 years 10 months ago
A SAT-Based Version Space Algorithm for Acquiring Constraint Satisfaction Problems
Constraint programming is rapidly becoming the technology of choice for modelling and solving complex combinatorial problems. However, users of this technology need significant ex...
Christian Bessière, Remi Coletta, Fré...