451 search results - page 22 / 91 » Approximation algorithms for stochastic orienteering |
TNN
1998
13 years 8 months ago
1998
— In this paper, we perform a complete asymptotic performance analysis of the stochastic approximation algorithm (denoted subspace network learning algorithm) derived from Oja’...
WINE
2007
Springer
14 years 2 months ago
2007
Springer
Internet search companies sell advertisement slots based on users’ search queries via an auction. Advertisers have to solve a complex optimization problem of how to place bids o...
ESANN
2004
13 years 10 months ago
2004
Abstract. Many real world problems are given in the form of multiple measurements comprising local descriptions or tasks. We propose that a dynamical organization of a population o...
NIPS
2003
13 years 10 months ago
2003
We describe a new approximation algorithm for solving partially observable MDPs. Our bounded policy iteration approach searches through the space of bounded-size, stochastic fini...
ICPR
2008
IEEE
14 years 3 months ago
2008
IEEE
This paper proposes a new approach to describe the salient contours in cluttered scenes. No need to do the preprocessing, such as edge detection, we directly use a set of random s...