Sciweavers

202 search results - page 13 / 41
» Improving the Global Constraint SoftPrec
Sort
View
SARA
2009
Springer
14 years 2 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
DATAMINE
2010
166views more  DATAMINE 2010»
13 years 7 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
SARA
2007
Springer
14 years 1 months ago
Generating Implied Boolean Constraints Via Singleton Consistency
Though there exist some rules of thumb for design of good models for solving constraint satisfaction problems, the modeling process still belongs more to art than to science. Moreo...
Roman Barták
ICDE
1997
IEEE
92views Database» more  ICDE 1997»
14 years 8 months ago
Distributing Semantic Constraints Between Heterogeneous Databases
In recent years, research about distributing databases over networks has become increasingly important. Here we concentrate on the issues of interoperability of heterogeneous DBMS...
Stefan Grufman, Fredrik Samson, Suzanne M. Embury,...
ICRA
2002
IEEE
120views Robotics» more  ICRA 2002»
14 years 13 days ago
Workspace Optimization of 3-UPU Parallel Platforms with Joint Constraints
In this paper the workspace optimization of translational 3-UPU parallel platforms with prismatic and universal joint constraints is performed. The workspace is parameterized usin...
Mircea Badescu, Jeremy Morman, Constantinos Mavroi...