Sciweavers

2750 search results - page 183 / 550
» The complexity of learning SUBSEQ(A)
Sort
View
ROMAN
2007
IEEE
134views Robotics» more  ROMAN 2007»
16 years 1 months ago
Learning Reward Modalities for Human-Robot-Interaction in a Cooperative Training Task
—This paper proposes a novel method of learning a users preferred reward modalities for human-robot interaction through solving a cooperative training task. A learning algorithm ...
Anja Austermann, Seiji Yamada
CEEMAS
2003
Springer
16 years 21 hour ago
On a Dynamical Analysis of Reinforcement Learning in Games: Emergence of Occam's Razor
Modeling learning agents in the context of Multi-agent Systems requires an adequate understanding of their dynamic behaviour. Usually, these agents are modeled similar to the diļ¬...
Karl Tuyls, Katja Verbeeck, Sam Maes
PODS
2010
ACM
170views Database» more  PODS 2010»
15 years 12 months ago
A learning algorithm for top-down XML transformations
A generalization from string to trees and from languages to translations is given of the classical result that any regular language can be learned from examples: it is shown that ...
Aurélien Lemay, Sebastian Maneth, Joachim N...
ECAI
2000
Springer
15 years 11 months ago
Lazy Propositionalisation for Relational Learning
A number of Inductive Logic Programming (ILP) systems have addressed the problem of learning First Order Logic (FOL) discriminant definitions by first reformulating the FOL lear...
Érick Alphonse, Céline Rouveirol
ALT
1997
Springer
15 years 11 months ago
Learning DFA from Simple Examples
Efficient learning of DFA is a challenging research problem in grammatical inference. It is known that both exact and approximate (in the PAC sense) identifiability of DFA is har...
Rajesh Parekh, Vasant Honavar