5214 search results - page 258 / 1043 » The Online Specialization Problem |
180
click to vote
NIPS
2001
15 years 7 months ago
2001
Greedy approximation algorithms have been frequently used to obtain sparse solutions to learning problems. In this paper, we present a general greedy algorithm for solving a class...
134
click to vote
ADCM
2007
15 years 6 months ago
2007
A geometric derivation of numerical integrators for optimal control problems is proposed. It is based in the classical technique of generating functions adapted to the special fea...
212
click to vote
MOR
2006
15 years 6 months ago
2006
We study the multidimensional generalization of the classical Bin Packing problem: Given a collection of d-dimensional rectangles of specified sizes, the goal is to pack them into ...
147
click to vote
ORL
1998
15 years 5 months ago
1998
Crowder et al. (Oper. Res. 31 (1983) 803–834) conjectured that the separation problem for cover inequalities for binary integer programs is polynomially solvable. We show that t...
160
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Symmetry is a common feature of many combinatorial problems. Unfortunately eliminating all symmetry from a problem is often computationally intractable. This paper argues...