Matthias Ott, Frank Stephan  Home/Search
Context Related
| i11www.ira.uka.de/~...finiteisaac.ps.Z math.uniheidelberg.de/lo...ottisaac.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: math.uniheidelber...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . We study the problems of efficiently learning infinite branches for finite state trees and winninig strategies for closed finitestate games using membership, and branch or strategy queries, respectively. We show that generally no efficient branch learning algorithm exists but we provide such algorithms for several natural cases, in particular for deadend free finite-state trees, the class of trees such that the set of infinite branches has positive measure, and several classes of modulo... (Update)
Context of citations to this paper: More
...player finite state games [3, 15, 28] In such games there always exist winning strategies which can be executed by a finite automaton. In [19] it is investigated whether one can efficiently learn strategies for one and two player closed finite state games from membership and...
...player finite state games [2, 11, 24] In such games there always exist winning strategies which can be executed by a finite automaton. In [15] it is investigated whether one can efficiently learn strategies for one and two player closed finite state games from membership and...
Cited by: More
Learning to Win Process-Control Games Watching Game-Masters - Case, Ott, Sharma, Stephan (Correct)
Similar documents (at the sentence level):
13.8%: Learning Strategies for Infinite Games - Ott (1998) (Correct)
Active bibliography (related documents): More All
1.4: The Complexity of Learning Branches and Strategies from Queries - Ott, Stephan (1997) (Correct)
0.4: Structural Measures for Games and Process Control in the.. - Ott, Stephan (1997) (Correct)
0.3: On Learning To Coordinate: Random Bits Help.. - Case, Jain.. (Correct)
Similar documents based on text: More All
0.4: Relaxed Update and Partition Network Games - Bodlaender, Dinneen, Khoussainov (2001) (Correct)
0.3: Robust Learning Aided by Context - Case, Jain, Ott, Sharma, Stephan (1998) (Correct)
0.2: Avoiding Coding Tricks by Hyperrobust Learning - Ott, Stephan (1999) (Correct)
Related documents from co-citation: More All
2: A framework for behavioural cloning - Bain, Sammut - 1996
2: Learning branches and learning to win closed games - Kummer, Ott - 1996
2: Programs for machine learning (context) - Quinlan - 1993
BibTeX entry: (Update)
M. Ott and F. Stephan. The complexity of learning branches and strategies from queries. In Proceedings of the Eighth Annual International Symposium on Algorithms and Computation, 1997. http://citeseer.ist.psu.edu/article/ott97complexity.html More
@inproceedings{ ott97complexity,
author = "Ott and Stephan",
title = "The Complexity of Learning Branches and Strategies from Queries",
booktitle = "{ISAAC}: 8th International Symposium on Algorithms and Computation (formerly {SIGAL} International Symposium on Algorithms), Organized by Special Interest Group on Algorithms ({SIGAL}) of the Information Processing Society of Japan ({IPSJ}) and the Technical Group on Theoretical Foundation of Computing of the Institute of Electronics, Information and Communication Engineers ({IEICE}))",
year = "1997",
url = "citeseer.ist.psu.edu/article/ott97complexity.html" }
Citations (may not include all citations):441 Queries and concept learning (context) - Angluin - 1988
244 Learning regular sets from queries and counterexamples (context) - Angluin - 1987
126 Learning in Embedded Systems (context) - Kaelbling - 1993
78 the synthesis of strategies in infinite games - Thomas - 1995
67 Negative results for equivalence queries (context) - Angluin - 1990
67 Measure Theory (context) - Halmos - 1950
49 Solving sequential conditions by finite-state strategies (context) - Buchi, Landweber - 1969
46 Infinite games played on finite graphs (context) - McNaughton - 1993
29 A note on the number of queries needed to identify regular l.. (context) - Angluin - 1981
13 From inductive inference to algorithmic learning theory (context) - Wiehagen - 1994
10 On polynomial-size programs winning finite-state games - Lescow - 1995
9 A competitive approach to game learning - Rosin, Belew - 1996
6 Learning branches and learning to win closed games - Kummer, Ott - 1996
4 Structural measures for games and process control in the bra.. - Ott, Stephan
4 Effective strategies for enumeration games - Kummer, Ott - 1996
3 Learning to w (context) - Case, Ott et al.
Documents on the same site (http://math.uni-heidelberg.de/logic/fstephan/publications.html): More
Noisy Inference and Oracles - Stephan (1996) (Correct)
On Optimizing Diameter and Average Distance of Directed.. - Braun, Stephan (1993) (Correct)
Learning via Queries and Oracles - Stephan (1996) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC