Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

27

STOC
1993
ACM

favoriteEmaildiscussreport

103views Algorithms» more STOC 1993»

Efficient learning of typical finite automata from random walks

14 years 3 months ago

Efficient learning of typical finite automata from random walks

Download www.cs.princeton.edu

Yoav Freund, Michael J. Kearns, Dana Ron, Ronitt R

Real-time Traffic

Algorithms | STOC 1993 |

claim paper

Related Content

» Solving the Satisfiability Problem Using Finite Learning Automata

» When Random Play is Optimal Against an Adversary

Post Info
More Details (n/a)

Added	10 Aug 2010
Updated	10 Aug 2010
Type	Conference
Year	1993
Where	STOC
Authors	Yoav Freund, Michael J. Kearns, Dana Ron, Ronitt Rubinfeld, Robert E. Schapire, Linda Sellie

Comments (0)