Sciweavers

9886 search results - page 418 / 1978
» Learning Compressible Models
Sort
View
COCO
2001
Springer
149views Algorithms» more  COCO 2001»
15 years 9 months ago
Quantum versus Classical Learnability
Motivated by recent work on quantum black-box query complexity, we consider quantum versions of two wellstudied models of learning Boolean functions: Angluin’s model of exact le...
Rocco A. Servedio, Steven J. Gortler
COLT
1995
Springer
15 years 8 months ago
On the Learnability and Usage of Acyclic Probabilistic Finite Automata
We propose and analyze a distribution learning algorithm for a subclass of Acyclic Probabilistic Finite Automata (APFA). This subclass is characterized by a certain distinguishabi...
Dana Ron, Yoram Singer, Naftali Tishby
ICALT
2008
IEEE
15 years 11 months ago
Learning Application Suite Creating and Playing SCORM Compatible Web and Computer Based Training
In the process of developing Web Based Training (WBT) applications, the Sharable Content Object Reference Model (SCORM) has become the most common eLearning standard making it pos...
Marco Nordmann, Jens Neumann
LAMAS
2005
Springer
15 years 10 months ago
Multi-agent Relational Reinforcement Learning
In this paper we report on using a relational state space in multi-agent reinforcement learning. There is growing evidence in the Reinforcement Learning research community that a r...
Tom Croonenborghs, Karl Tuyls, Jan Ramon, Maurice ...
140
Voted
HICSS
2003
IEEE
120views Biometrics» more  HICSS 2003»
15 years 10 months ago
Evaluating On-line Learning Platforms: a Case Study
Our “information-oriented” society shows an increasing exigency of life-long learning. In such framework, online Learning is becoming an important tool to allow the flexibilit...
Francesco Colace, Massimo De Santo, Mario Vento