Sciweavers

12950 search results - page 2433 / 2590
» On Optimal Timed Strategies
Sort
View
CORR
2007
Springer
106views Education» more  CORR 2007»
13 years 9 months ago
Bandit Algorithms for Tree Search
Bandit based methods for tree search have recently gained popularity when applied to huge trees, e.g. in the game of go [6]. Their efficient exploration of the tree enables to ret...
Pierre-Arnaud Coquelin, Rémi Munos
CORR
2007
Springer
170views Education» more  CORR 2007»
13 years 9 months ago
Animation of virtual mannequins, robot-like simulation or motion captures
— In order to optimize the costs and time of design of the new products while improving their quality, concurrent engineering is based on the digital model of these products, the...
Damien Chablat
ISCA
2006
IEEE
130views Hardware» more  ISCA 2006»
13 years 9 months ago
Area-Performance Trade-offs in Tiled Dataflow Architectures
: Tiled architectures, such as RAW, SmartMemories, TRIPS, and WaveScalar, promise to address several issues facing conventional processors, including complexity, wire-delay, and pe...
Steven Swanson, Andrew Putnam, Martha Mercaldi, Ke...
JACM
2006
99views more  JACM 2006»
13 years 9 months ago
Finding a maximum likelihood tree is hard
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
Benny Chor, Tamir Tuller
NN
2008
Springer
143views Neural Networks» more  NN 2008»
13 years 9 months ago
A batch ensemble approach to active learning with model selection
Optimally designing the location of training input points (active learning) and choosing the best model (model selection) are two important components of supervised learning and h...
Masashi Sugiyama, Neil Rubens
« Prev « First page 2433 / 2590 Last » Next »