Sciweavers

72 search results - page 6 / 15
» Learning Stochastic Finite Automata
Sort
View
RIA
2006
84views more  RIA 2006»
13 years 7 months ago
Learning Recursive Automata from Positive Examples
In this theoretical paper, we compare the "classical" learning techniques used to infer regular grammars from positive examples with the ones used to infer categorial gra...
Isabelle Tellier
ESANN
2006
13 years 9 months ago
Learning for stochastic dynamic programming
Abstract. We present experimental results about learning function values (i.e. Bellman values) in stochastic dynamic programming (SDP). All results come from openDP (opendp.sourcef...
Sylvain Gelly, Jérémie Mary, Olivier...
TSMC
2008
146views more  TSMC 2008»
13 years 7 months ago
Decentralized Learning in Markov Games
Learning Automata (LA) were recently shown to be valuable tools for designing Multi-Agent Reinforcement Learning algorithms. One of the principal contributions of LA theory is tha...
Peter Vrancx, Katja Verbeeck, Ann Nowé
DKE
2006
139views more  DKE 2006»
13 years 7 months ago
Information extraction from structured documents using k-testable tree automaton inference
Information extraction (IE) addresses the problem of extracting specific information from a collection of documents. Much of the previous work on IE from structured documents, suc...
Raymond Kosala, Hendrik Blockeel, Maurice Bruynoog...
ICRA
2003
IEEE
116views Robotics» more  ICRA 2003»
14 years 23 days ago
Learning to role-switch in multi-robot systems
We present an approach that uses Q-learning on individual robotic agents, for coordinating a missiontasked team of robots in a complex scenario. To reduce the size of the state sp...
Eric Martinson, Ronald C. Arkin