3422 search results - page 280 / 685 » Random Subset Optimization |
173
Voted
TCS
2008
15 years 5 months ago
2008
In evaluating the performance of online algorithms for search trees, one wants to compare them to the best offline algorithm available. In this paper we lower bound the cost of an...
122
click to vote
OL
2010
15 years 3 months ago
2010
In an important paper, Burer [2] recently showed how to reformulate general mixed-binary quadratic optimization problems (QPs) into copositive programs where a linear functional i...
127
click to vote
SAB
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. Population of simulated agents controlled by dynamical neural networks are trained by artificial evolution to access linguistic instructions and to execute them by indic...
164
Voted
IPCO
2010
15 years 2 months ago
2010
We present a branch-and-bound algorithm for minimizing a convex quadratic objective function over integer variables subject to convex constraints. In a given node of the enumerati...
160
Voted
CCE
2010
15 years 2 months ago
2010
In this work we address the problem of solving multiscenario optimization models that are deterministic equivalents of two-stage stochastic programs. We present a heuristic approx...