1647 search results - page 40 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
121
click to vote
STOC
2009
ACM
16 years 2 months ago
2009
ACM
Consider the edge-connectivity survivable network design problem: given a graph G = (V, E) with edge-costs, and edgeconnectivity requirements rij Z0 for every pair of vertices i,...
136
Voted
STACS
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. In recent years, probabilistic analyses of algorithms have received increasing attention. Despite results on the average-case complexity and smoothed complexity of exact ...
ATAL
2008
Springer
15 years 4 months ago
2008
Springer
In this paper, we show how adaptive prototype optimization can be used to improve the performance of function approximation based on Kanerva Coding when solving largescale instanc...
118
click to vote
SIGECOM
2009
ACM
15 years 8 months ago
2009
ACM
We study online pricing problems in markets with cancellations, i.e., markets in which prior allocation decisions can be revoked, but at a cost. In our model, a seller receives re...
108
click to vote
WSC
2001
15 years 3 months ago
2001
We examine the theoretical and numerical global convergence properties of a certain "gradient free" stochastic approximation algorithm called the "simultaneous pertu...