744 search results - page 27 / 149 » Observations on the Decidability of Transitions |
ICGI
2010
Springer
13 years 7 months ago
2010
Springer
In this paper we extend the PAC learning algorithm due to Clark and Thollard for learning distributions generated by PDFA to automata whose transitions may take varying time length...
AGENTS
1999
Springer
14 years 1 months ago
1999
Springer
In this paper, we present a novel multi-agent learning paradigm called team-partitioned, opaque-transition reinforcement learning (TPOT-RL). TPOT-RL introduces the concept of usin...
INFOCOM
2010
IEEE
13 years 7 months ago
2010
IEEE
— Retransmissions serve as the basic building block that communication protocols use to achieve reliable data transfer. Until recently, the number of retransmissions were thought...
FSTTCS
2007
Springer
14 years 3 months ago
2007
Springer
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...
CORR
2007
Springer
13 years 9 months ago
2007
Springer
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...