187 search results - page 26 / 38 » Hedging Uncertainty: Approximation Algorithms for Stochastic... |
NIPS
2007
14 years 11 months ago
2007
Guided by the goal of obtaining an optimization algorithm that is both fast and yields good generalization, we study the descent direction maximizing the decrease in generalizatio...
ESA
2008
Springer
14 years 11 months ago
2008
Springer
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...
101
click to vote
ROBOCOMM
2007
IEEE
15 years 3 months ago
2007
IEEE
— Consider the following scenario: a spatio-temporal stochastic process generates service requests, localized at points in a bounded region on the plane; these service requests a...
136
click to vote
PKDD
2010
Springer
14 years 7 months ago
2010
Springer
Partially observable Markov decision processes (POMDPs) are widely used for planning under uncertainty. In many applications, the huge size of the POMDP state space makes straightf...
100
click to vote
TON
2008
14 years 9 months ago
2008
We study the problem of load balancing the traffic from a set of unicast and multicast sessions. The problem is formulated as an optimization problem. However, we assume that the g...