161 search results - page 5 / 33 » Learning Finite Automata Using Label Queries |
RIA
2006
14 years 9 months ago
2006
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...
AMAI
2004
Springer
15 years 2 months ago
2004
Springer
This work introduces a new query inference model that can access data and communicate with a teacher by asking finitely many boolean queries in a language L. In this model the pa...
COLT
1995
Springer
15 years 1 months ago
1995
Springer
In this paper, we study PAC-leaming algorithms for specialized classes of deterministic finite automata (DFA). Inpartictdar, we study branchingprogrsms, and we investigate the int...
68
Voted
ICRA
2003
IEEE
15 years 2 months ago
2003
IEEE
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...
114
Voted
SIGIR
2005
ACM
15 years 3 months ago
2005
ACM
Accurate topical categorization of user queries allows for increased effectiveness, efficiency, and revenue potential in general-purpose web search systems. Such categorization be...