424 search results - page 27 / 85 » Boosted sampling: approximation algorithms for stochastic op... |
CDC
2010
IEEE
13 years 2 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...
EMMCVPR
2005
Springer
14 years 1 months ago
2005
Springer
This paper addresses the problem of efficient information theoretic, non-parametric data clustering. We develop a procedure for adapting the cluster memberships of the data pattern...
NIPS
1998
13 years 9 months ago
1998
In this paper, we address two issues of long-standing interest in the reinforcement learning literature. First, what kinds of performance guarantees can be made for Q-learning aft...
CP
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. We study the problem of maximizing the amount of stochastic diffusion in a network by acquiring nodes within a certain limited budget. We use a Sample Average Approximati...
SYNTHESE
2008
2008
How experimental algorithmics can benefit from Mayo's extensions to Neyman-Pearson theory of testing
13 years 7 months ago
Although theoretical results for several algorithms in many application domains were presented during the last decades, not all algorithms can be analyzed fully theoretically. Exp...