Sciweavers

26 search results - page 3 / 6
» An Interval Lattice-Based Constraint Solving Framework for L...
Sort
View
CLA
2007
13 years 6 months ago
An FDP-Algorithm for Drawing Lattices
In this work we want to discuss an algorithm for drawing line diagrams of lattices based on force directed placement (FDP). This widely used technique in graph drawing introduces f...
Christian Zschalig
CP
2008
Springer
13 years 7 months ago
A New Framework for Sharp and Efficient Resolution of NCSP with Manifolds of Solutions
When numerical CSPs are used to solve systems of n equations with n variables, the preconditioned interval Newton operator plays two key roles: First it allows handling the n equat...
Alexandre Goldsztejn, Laurent Granvilliers
DATAMINE
2010
166views more  DATAMINE 2010»
13 years 5 months ago
Optimal constraint-based decision tree induction from itemset lattices
In this article we show that there is a strong connection between decision tree learning and local pattern mining. This connection allows us to solve the computationally hard probl...
Siegfried Nijssen, Élisa Fromont
ICTAI
2008
IEEE
13 years 11 months ago
Probabilistic Continuous Constraint Satisfaction Problems
Constraint programming has been used in many applications where uncertainty arises to model safe reasoning. The goal of constraint propagation is to propagate intervals of uncerta...
Elsa Carvalho, Jorge Cruz, Pedro Barahona
SARA
2009
Springer
13 years 11 months ago
Some Interval Approximation Techniques for MINLP
MINLP problems are hard constrained optimization problems, with nonlinear constraints and mixed discrete continuous variables. They can be solved using a Branch-and-Bound scheme c...
Nicolas Berger, Laurent Granvilliers