Sciweavers

11910 search results - page 379 / 2382
» Online Learning Algorithms
Sort
View
IJCAI
2001
15 years 8 months ago
R-MAX - A General Polynomial Time Algorithm for Near-Optimal Reinforcement Learning
R-max is a very simple model-based reinforcement learning algorithm which can attain near-optimal average reward in polynomial time. In R-max, the agent always maintains a complet...
Ronen I. Brafman, Moshe Tennenholtz
ADMA
2006
Springer
121views Data Mining» more  ADMA 2006»
16 years 21 days ago
A New Polynomial Time Algorithm for Bayesian Network Structure Learning
We propose a new algorithm called SCD for learning the structure of a Bayesian network. The algorithm is a kind of constraintbased algorithm. By taking advantage of variable orderi...
Sanghack Lee, Jihoon Yang, Sungyong Park
GECCO
2004
Springer
16 years 3 days ago
Introducing Subchromosome Representations to the Linkage Learning Genetic Algorithm
This paper introduces subchromosome representations to the linkage learning genetic algorithm (LLGA). The subchromosome representation is utilized for effectively lowering the num...
Ying-Ping Chen, David E. Goldberg
IICS
2009
Springer
16 years 1 months ago
Web 2.0 as an Autopoietic System - Implications for Innovative Web-Interfaces
: The Web 2.0 can be regarded as an evolutionary process of medial differentiation. Infinite online communities are emerging and disappearing. It seems that a race has started in s...
Kathrin Vent
AAAI
2006
15 years 8 months ago
Learning Partially Observable Action Models: Efficient Algorithms
We present tractable, exact algorithms for learning actions' effects and preconditions in partially observable domains. Our algorithms maintain a propositional logical repres...
Dafna Shahaf, Allen Chang, Eyal Amir