Sciweavers

3020 search results - page 454 / 604
» Optimal partition trees
Sort
View
IJCAI
2007
15 years 7 months ago
Using Linear Programming for Bayesian Exploration in Markov Decision Processes
A key problem in reinforcement learning is finding a good balance between the need to explore the environment and the need to gain rewards by exploiting existing knowledge. Much ...
Pablo Samuel Castro, Doina Precup
IWMMDBMS
1998
139views more  IWMMDBMS 1998»
15 years 7 months ago
Fusion of Multimedia Information
: In recent years the fusion of multimedia information from multiple real-time sources and databases has become increasingly important because of its practical significance in many...
Shi-Kuo Chang, Taieb Znati
SODA
1998
ACM
104views Algorithms» more  SODA 1998»
15 years 7 months ago
On-line Randomized Call Control Revisited
We consider the problem of on-line call admission and routing on trees and meshes. Previous work gave randomized on-line algorithms for these problems and proved that they have opt...
Stefano Leonardi, Alberto Marchetti-Spaccamela, Al...
UAI
2000
15 years 7 months ago
Rao-Blackwellised Particle Filtering for Dynamic Bayesian Networks
Particle filters (PFs) are powerful samplingbased inference/learning algorithms for dynamic Bayesian networks (DBNs). They allow us to treat, in a principled way, any type of prob...
Arnaud Doucet, Nando de Freitas, Kevin P. Murphy, ...
GECCO
2008
Springer
111views Optimization» more  GECCO 2008»
15 years 7 months ago
Multi-task code reuse in genetic programming
We propose a method of knowledge reuse between evolutionary processes that solve different optimization tasks. We define the method in the framework of tree-based genetic progra...
Wojciech Jaskowski, Krzysztof Krawiec, Bartosz Wie...