Sciweavers

3 search results - page 1 / 1
» Efficient learning of typical finite automata from random wa...
Sort
View
STOC
1993
ACM
103views Algorithms» more  STOC 1993»
13 years 11 months ago
Efficient learning of typical finite automata from random walks
Yoav Freund, Michael J. Kearns, Dana Ron, Ronitt R...
IJCSA
2007
104views more  IJCSA 2007»
13 years 7 months ago
Solving the Satisfiability Problem Using Finite Learning Automata
A large number of problems that occur in knowledge-representation, learning, VLSI-design, and other areas of artificial intelligence, are essentially satisfiability problems. The ...
Ole-Christoffer Granmo, Noureddine Bouhmala
COLT
2008
Springer
13 years 9 months ago
When Random Play is Optimal Against an Adversary
We analyze a sequential game between a Gambler and a Casino. The Gambler allocates bets from a limited budget over a fixed menu of gambling events that are offered at equal time i...
Jacob Abernethy, Manfred K. Warmuth, Joel Yellin