Sciweavers

2374 search results - page 225 / 475
» Fast Distributed Algorithms for Computing Separable Function...
Sort
View
CG
2006
Springer
15 years 6 months ago
Efficient Selectivity and Backup Operators in Monte-Carlo Tree Search
Monte-Carlo evaluation consists in estimating a position by averaging the outcome of several random continuations, and can serve as an evaluation function at the leaves of a min-ma...
Rémi Coulom
EMO
2005
Springer
194views Optimization» more  EMO 2005»
15 years 8 months ago
An EMO Algorithm Using the Hypervolume Measure as Selection Criterion
Abstract. The hypervolume measure is one of the most frequently applied measures for comparing the results of evolutionary multiobjective optimization algorithms (EMOA). The idea t...
Michael Emmerich, Nicola Beume, Boris Naujoks
152
Voted
UAI
2008
15 years 4 months ago
Dyna-Style Planning with Linear Function Approximation and Prioritized Sweeping
We consider the problem of efficiently learning optimal control policies and value functions over large state spaces in an online setting in which estimates must be available afte...
Richard S. Sutton, Csaba Szepesvári, Alborz...
PPOPP
2010
ACM
16 years 12 days ago
A practical concurrent binary search tree
We propose a concurrent relaxed balance AVL tree algorithm that is fast, scales well, and tolerates contention. It is based on optimistic techniques adapted from software transact...
Nathan Grasso Bronson, Jared Casper, Hassan Chafi,...
GECCO
2007
Springer
183views Optimization» more  GECCO 2007»
15 years 7 months ago
Evolving distributed agents for managing air traffic
Air traffic management offers an intriguing real world challenge to designing large scale distributed systems using evolutionary computation. The ability to evolve effective air t...
Adrian K. Agogino, Kagan Tumer