Sciweavers

2543 search results - page 338 / 509
» Optimal Ordered Problem Solver
Sort
View
SIAMJO
2010
130views more  SIAMJO 2010»
14 years 7 months ago
A Randomized Cutting Plane Method with Probabilistic Geometric Convergence
Abstract. We propose a randomized method for general convex optimization problems; namely, the minimization of a linear function over a convex body. The idea is to generate N rando...
Fabrizio Dabbene, P. S. Shcherbakov, Boris T. Poly...
111
Voted
INFOCOM
2010
IEEE
14 years 11 months ago
Distributed Caching Algorithms for Content Distribution Networks
—The delivery of video content is expected to gain huge momentum, fueled by the popularity of user-generated clips, growth of VoD libraries, and wide-spread deployment of IPTV se...
Sem C. Borst, Varun Gupta, Anwar Walid
96
Voted
GECCO
2005
Springer
158views Optimization» more  GECCO 2005»
15 years 6 months ago
A genetic algorithm approach to the selection of near-optimal subsets from large sets
The problem attempted in this paper is to select a sample from a large set where the sample is required to have a particular average property. The problem can be expressed as an o...
P. Whiting, P. W. Poon, J. N. Carter
104
Voted
CPAIOR
2006
Springer
15 years 4 months ago
Online Stochastic Reservation Systems
This paper considers online stochastic reservation problems, where requests come online and must be dynamically allocated to limited resources in order to maximize profit. Multi-k...
Pascal Van Hentenryck, Russell Bent, Yannis Vergad...
94
Voted
ESA
2006
Springer
102views Algorithms» more  ESA 2006»
15 years 4 months ago
Necklaces, Convolutions, and X + Y
We give subquadratic algorithms that, given two necklaces each with n beads at arbitrary positions, compute the optimal rotation of the necklaces to best align the beads. Here ali...
David Bremner, Timothy M. Chan, Erik D. Demaine, J...