451 search results - page 54 / 91 » Approximation algorithms for stochastic orienteering |
SODA
2008
ACM
13 years 10 months ago
2008
ACM
This paper studies an extension of the k-median problem where we are given a metric space (V, d) and not just one but m client sets {Si V }m i=1, and the goal is to open k facili...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
A pants decomposition of an orientable surface is a collection of simple cycles that partition into pants, i.e., surfaces of genus zero with three boundary cycles. Given a set P...
NIPS
1990
13 years 9 months ago
1990
In this paper, we show that the LVQ learning algorithm converges to locally asymptotic stable equilibria of an ordinary differential equation. We show that the learning algorithm ...
SIGMETRICS
2004
ACM
14 years 2 months ago
2004
ACM
Low priority data transfer across the wide area is useful in several contexts, for example for the dissemination of large files such as OS updates, content distribution or prefet...
AUTOMATICA
2006
13 years 8 months ago
2006
A simulation-based optimization framework involving simultaneous perturbation stochastic approximation (SPSA) is presented as a means for optimally specifying parameters of intern...