6110 search results - page 199 / 1222 » Approximate Computing |
185
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Temporal difference methods are theoretically grounded and empirically effective methods for addressing reinforcement learning problems. In most real-world reinforcement learning ...
171
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
In this paper we study stochastic dynamic games with many players that are relevant for a wide range of social, economic, and engineering applications. The standard solution conce...
177
click to vote
GLOBECOM
2006
IEEE
16 years 17 days ago
2006
IEEE
—Several dynamic call admission control (CAC) schemes for cellular networks have been proposed in the literature to reserve resources adaptively to provide the desired quality of...
137
click to vote
FOCS
2003
IEEE
15 years 11 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...
133
click to vote
WDAG
2007
Springer
16 years 18 days ago
2007
Springer
We describe and analyze a 3-state one-way population protocol to compute approximate majority in the model in which pairs of agents are drawn uniformly at random to interact. Given...