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=241
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A discipline of evolutionary programming
Paul Vitányi
Theoretical Computer Science
241
(1-2), 2000, pp. 3-23
Improved bounds about on-line learning of smooth-functions of a single variable
Philip M. Long
Theoretical Computer Science
241
(1-2), 2000, pp. 25-35
The learnability of exclusive-or expansions based on monotone DNF formulas
Eiji Takimoto
,
Yoshifumi Sakai
,
Akira Maruoka
Theoretical Computer Science
241
(1-2), 2000, pp. 37-50
Exact learning via teaching assistants
V. Arvind
,
N.V. Vinodchandran
Theoretical Computer Science
241
(1-2), 2000, pp. 51-81
Query learning of bounded-width OBDDs
Atsuyoshi Nakamura
Theoretical Computer Science
241
(1-2), 2000, pp. 83-114
Vacillatory and BC learning on noisy data
John Case
,
Sanjay Jain
,
Frank Stephan
Theoretical Computer Science
241
(1-2), 2000, pp. 115-141
Learning languages and functions by erasing
Sanjay Jain
,
Efim Kinber
,
Steffen Lange
,
Rolf Wiehagen
,
Thomas Zeugmann
Theoretical Computer Science
241
(1-2), 2000, pp. 143-189
Inductive inference of unbounded unions of pattern languages from positive data
Takeshi Shinohara
,
Hiroki Arimura
Theoretical Computer Science
241
(1-2), 2000, pp. 191-209
Some classes of Prolog programs inferable from positive data
M.R.K. Krishna Rao
Theoretical Computer Science
241
(1-2), 2000, pp. 211-234