451 search results - page 19 / 91 » Approximation algorithms for stochastic orienteering |
114
click to vote
SIAMCO
2000
15 years 4 months ago
2000
In this paper, a perturbation expansion technique is introduced to decompose the tracking error of a general adaptive tracking algorithm in a linear regression model. This method ...
118
click to vote
AMC
2008
15 years 4 months ago
2008
This paper discusses the infinite horizon stochastic Nash games with state-dependent noise. After establishing the asymptotic structure along with the positive semidefiniteness for...
151
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Abstract Consider a random graph model where each possible edge e is present independently with some probability pe. Given these probabilities, we want to build a large/heavy match...
136
click to vote
WSC
2008
15 years 6 months ago
2008
We consider discrete stochastic optimization problems where the objective function can only be estimated by a simulation oracle; the oracle is defined only at the discrete points....
166
click to vote
ICALP
2004
Springer
15 years 9 months ago
2004
Springer
We study graph orientations that minimize the entropy of the in-degree sequence. The problem of finding such an orientation is an interesting special case of the minimum entropy ...