default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 241
Volume 241, Numbers 1-2, 28 June 2000
- Paul M. B. Vitányi:
A discipline of evolutionary programming. 3-23 - Philip M. Long:
Improved bounds about on-line learning of smooth-functions of a single variable. 25-35 - Eiji Takimoto, Yoshifumi Sakai, Akira Maruoka:
The learnability of exclusive-or expansions based on monotone DNF formulas. 37-50 - Vikraman Arvind, N. V. Vinodchandran:
Exact learning via teaching assistants. 51-81 - Atsuyoshi Nakamura
:
Query learning of bounded-width OBDDs. 83-114 - John Case, Sanjay Jain, Frank Stephan:
Vacillatory and BC learning on noisy data. 115-141 - Sanjay Jain, Efim B. Kinber, Steffen Lange, Rolf Wiehagen, Thomas Zeugmann:
Learning languages and functions by erasing. 143-189 - Takeshi Shinohara, Hiroki Arimura:
Inductive inference of unbounded unions of pattern languages from positive data. 191-209 - M. R. K. Krishna Rao:
Some classes of prolog programs inferable from positive data. 211-234
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-10-31 20:16 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
