Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Theor.~Comput.~Sci. AND Volume=397
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Learning recursive functions: A survey
Thomas Zeugmann
,
Sandra Zilles
Theoretical Computer Science
397
(1-3), 2008, pp. 4-56
Reflective inductive inference of recursive functions
Gunter Grieser
Theoretical Computer Science
397
(1-3), 2008, pp. 57-69
Quantum inductive inference by finite automata
R. Freivalds
,
R.F. Bonner
Theoretical Computer Science
397
(1-3), 2008, pp. 70-76
Nonstochastic bandits: Countable decision set, unbounded costs and reactive environments
Jan Poland
Theoretical Computer Science
397
(1-3), 2008, pp. 77-93
Measuring teachability using variants of the teaching dimension
Frank J. Balbach
Theoretical Computer Science
397
(1-3), 2008, pp. 94-113
Absolute versus probabilistic classification in a logical setting
Sanjay Jain
,
Eric Martin
,
Frank Stephan
Theoretical Computer Science
397
(1-3), 2008, pp. 114-128
Some classes of term rewriting systems inferable from positive data
M.R.K. Krishna Rao
Theoretical Computer Science
397
(1-3), 2008, pp. 129-149
Developments from enquiries into the learnability of the pattern languages from positive data
Yen Kaow Ng
,
Takeshi Shinohara
Theoretical Computer Science
397
(1-3), 2008, pp. 150-165
Discontinuities in pattern inference
Daniel Reidenbach
Theoretical Computer Science
397
(1-3), 2008, pp. 166-193
Learning indexed families of recursive languages from positive data: A survey
Steffen Lange
,
Thomas Zeugmann
,
Sandra Zilles
Theoretical Computer Science
397
(1-3), 2008, pp. 194-232
Learning and extending sublanguages
Sanjay Jain
,
Efim Kinber
Theoretical Computer Science
397
(1-3), 2008, pp. 233-246