451 search results - page 18 / 91 » Approximation algorithms for stochastic orienteering |
114
Voted
CDC
2010
IEEE
14 years 7 months ago
2010
IEEE
Abstract-- In robot deployment problems, the fundamental issue is to optimize a steady state performance measure that depends on the spatial configuration of a group of robots. For...
230
click to vote
SDM
2011
SIAM
14 years 3 months ago
2011
SIAM
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
99
Voted
NIPS
1993
15 years 1 months ago
1993
Recent developments in the area of reinforcement learning have yielded a number of new algorithms for the prediction and control of Markovian environments. These algorithms,includ...
111
Voted
VMV
2001
15 years 1 months ago
2001
In this paper, we present a theoretical analysis of the error with three basic Monte Carlo radiosity algorithms, based on continuous collision shooting random walks, discrete coll...
EGC
2005
Springer
15 years 6 months ago
2005
Springer
Genetic algorithms (GAs) are stochastic search methods that have been successfully applied in many search, optimization, and machine learning problems. Their parallel counterpart (...