Sciweavers

62 search results - page 9 / 13
» Learning and Exploiting Relative Weaknesses of Opponent Agen...
Sort
View
ICCBR
2007
Springer
15 years 3 months ago
An Analysis of Case-Based Value Function Approximation by Approximating State Transition Graphs
We identify two fundamental points of utilizing CBR for an adaptive agent that tries to learn on the basis of trial and error without a model of its environment. The first link co...
Thomas Gabel, Martin Riedmiller
PKDD
2009
Springer
102views Data Mining» more  PKDD 2009»
15 years 4 months ago
Relevance Grounding for Planning in Relational Domains
Probabilistic relational models are an efficient way to learn and represent the dynamics in realistic environments consisting of many objects. Autonomous intelligent agents that gr...
Tobias Lang, Marc Toussaint
SOFSEM
2007
Springer
15 years 3 months ago
Incremental Learning of Planning Operators in Stochastic Domains
In this work we assume that there is an agent in an unknown environment (domain). This agent has some predefined actions and it can perceive its current state in the environment c...
Javad Safaei, Gholamreza Ghassem-Sani
JMLR
2006
153views more  JMLR 2006»
14 years 9 months ago
Collaborative Multiagent Reinforcement Learning by Payoff Propagation
In this article we describe a set of scalable techniques for learning the behavior of a group of agents in a collaborative multiagent setting. As a basis we use the framework of c...
Jelle R. Kok, Nikos A. Vlassis
AAAI
2010
14 years 11 months ago
Multi-Task Active Learning with Output Constraints
Many problems in information extraction, text mining, natural language processing and other fields exhibit the same property: multiple prediction tasks are related in the sense th...
Yi Zhang 0010