Sciweavers

2543 search results - page 17 / 509
» Optimal Ordered Problem Solver
Sort
View
166
Voted
DIS
2009
Springer
16 years 28 days ago
Linear Programming Boosting by Column and Row Generation
Abstract. We propose a new boosting algorithm based on a linear programming formulation. Our algorithm can take advantage of the sparsity of the solution of the underlying optimiza...
Kohei Hatano, Eiji Takimoto
174
Voted
EVOW
2007
Springer
15 years 10 months ago
Evaluation of Different Metaheuristics Solving the RND Problem
RND (Radio Network Design) is a Telecommunication problem consisting in covering a certain geographical area by using the smallest number of radio antennas achieving the biggest co...
Miguel A. Vega-Rodríguez, Juan Antonio G&oa...
178
Voted
ENTCS
2010
136views more  ENTCS 2010»
15 years 3 months ago
A Solver for Modal Fixpoint Logics
We present MLSolver, a tool for solving the satisfiability and validity problems for modal fixpoint logics. The underlying technique is based on characterisations of satisfiabilit...
Oliver Friedmann, Martin Lange
CP
2009
Springer
15 years 4 months ago
Lazy Clause Generation Reengineered
Abstract. Lazy clause generation is a powerful hybrid approach to combinatorial optimization that combines features from SAT solving and finite domain (FD) propagation. In lazy cla...
Thibaut Feydy, Peter J. Stuckey
161
Voted
CP
2009
Springer
15 years 4 months ago
Minimizing the Maximum Number of Open Stacks by Customer Search
We describe a new exact solver for the minimization of open stacks problem (MOSP). By combining nogood recording with a branch and bound strategy based on choosing which customer s...
Geoffrey Chu, Peter J. Stuckey