Sciweavers

251 search results - page 15 / 51
» On the Complexity of Learning Lexicographic Strategies
Sort
View
AAMAS
2005
Springer
13 years 10 months ago
Learning and Exploiting Relative Weaknesses of Opponent Agents
Agents in a competitive interaction can greatly benefit from adapting to a particular adversary, rather than using the same general strategy against all opponents. One method of s...
Shaul Markovitch, Ronit Reger
NN
2006
Springer
127views Neural Networks» more  NN 2006»
13 years 10 months ago
The asymptotic equipartition property in reinforcement learning and its relation to return maximization
We discuss an important property called the asymptotic equipartition property on empirical sequences in reinforcement learning. This states that the typical set of empirical seque...
Kazunori Iwata, Kazushi Ikeda, Hideaki Sakai
EDM
2010
150views Data Mining» more  EDM 2010»
13 years 12 months ago
Modeling Learning Trajectories with Epistemic Network Analysis: A Simulation-based Investigation of a Novel Analytic Method for
Epistemic games are designed to help players develop domain-specific expertise that characterizes how professionals in a particular domain reason, communicate, and act [1, 11]. To ...
Andre A. Rupp, Shauna J. Sweet, Younyoung Choi
IJCAI
1989
13 years 11 months ago
Building Robust Learning Systems by Combining Induction and Optimization
Each concept description language and search strategy has an inherent inductive bias, a preference for some hypotheses over others. No single inductive bias performs optimally on ...
David K. Tcheng, Bruce L. Lambert, Stephen C. Y. L...
AH
2004
Springer
14 years 3 months ago
Evaluating Adaptive Problem Selection
: This paper presents an evaluation study that compares two different problem selection strategies for an Intelligent Tutoring System (ITS). The first strategy uses static problem ...
Antonija Mitrovic, Brent Martin