416 search results - page 18 / 84 » Approximation Algorithms for Reliable Stochastic Combinatori... |
SODA
2012
ACM
11 years 11 months ago
2012
ACM
Motivated by online ad allocation, we study the problem of simultaneous approximations for the adversarial and stochastic online budgeted allocation problem. This problem consists...
JCO
2006
13 years 8 months ago
2006
The paper addresses the relay node placement problem in two-tiered wireless sensor networks. Given a set of sensor nodes in Euclidean plane, our objective is to place minimum numbe...
STOC
2009
ACM
14 years 9 months ago
2009
ACM
We consider the stochastic Steiner forest problem: suppose we were given a collection of Steiner forest instances, and were guaranteed that a random one of these instances would a...
CDC
2009
IEEE
13 years 12 months ago
2009
IEEE
— This paper presents a novel swarm approximate dynamic programming method (swarm-ADP) for parameter optimization of PSO systems, from the perspective of optimal control. Based o...
CAD
2005
Springer
13 years 8 months ago
2005
Springer
Since the publication of the original Marching Cubes algorithm, numerous variations have been proposed for guaranteeing water-tight constructions of triangulated approximations of...