1304 search results - page 74 / 261 » An Integrated Solver for Optimization Problems |
ICTAI
2009
IEEE
15 years 4 months ago
2009
IEEE
This paper presents an original dynamic subsumption technique for Boolean CNF formulae. It exploits simple and sufficient conditions to detect, during conflict analysis, clauses...
SARA
2009
Springer
15 years 4 months ago
2009
Springer
Tailoring solver-independent constraint instances to target solvers is an important component of automated constraint modelling. We augment the tailoring process by a set of enhan...
101
click to vote
SODA
2003
ACM
14 years 11 months ago
2003
ACM
The natural relaxation for the Group Steiner Tree problem, as well as for its generalization, the Directed Steiner Tree problem, is a flow-based linear programming relaxation. We...
ICPR
2008
IEEE
15 years 11 months ago
2008
IEEE
In this paper we consider the problem of solving different pose and registration problems under rotational constraints. Traditionally, methods such as the iterative closest point ...
ICTAI
1997
IEEE
15 years 1 months ago
1997
IEEE
Many black box optimization algorithms have sufcient exibility to allow them to adapt to the varying circumstances they encounter. These capabilities are of two primary sorts: 1) ...