451 search results - page 9 / 91 » Approximation algorithms for stochastic orienteering |
ALIFE
2002
14 years 9 months ago
2002
In this paper, we study the relationship between the two techniques known as ant colony optimization (aco) and stochastic gradient descent. More precisely, we show that some empir...
FOCS
2003
IEEE
15 years 2 months ago
2003
IEEE
In this paper, we give the rst constant-factor approximationalgorithmfor the rooted Orienteering problem, as well as a new problem that we call the Discounted-Reward TSP, motivate...
CDC
2008
IEEE
15 years 4 months ago
2008
IEEE
— This paper studies consensus seeking over noisy networks with time-varying noise statistics. Stochastic approximation type algorithms can ensure consensus in mean square and wi...
78
Voted
STOC
2009
ACM
15 years 10 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...
DAGSTUHL
2004
14 years 11 months ago
2004
We study algorithms for approximation of the mild solution of stochastic heat equations on the spatial domain ]0, 1[ d . The error of an algorithm is defined in L2-sense. We derive...