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...
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...
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...
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,...
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...