- 5 Ergebnisse
Kleinster Preis: € 42,79, größter Preis: € 71,39, Mittelwert: € 65,67
1
Computational Learning Theory - Paul Vitanyi
Bestellen
bei Springer.com
€ 71,39
Bestellen
Details und Versand
gesponserter Link
Paul Vitanyi:

Computational Learning Theory - neues Buch

ISBN: 9783540491958

This volume presents the proceedings of the Second European Conference on Computational Learning Theory (EuroCOLT '95), held in Barcelona, Spain in March 1995. The book contains full vers… Mehr…

  - new in stock. Versandkosten:zzgl. Versandkosten.
zuklappen (X)
2
Computational Learning Theory
Bestellen
bei Springer.com
€ 42,79
Versand: € 0,001
Bestellen
Details beim Anbieter
gesponserter Link
Computational Learning Theory - neues Buch

ISBN: 9783540491958

This volume presents the proceedings of the Second European Conference on Computational Learning Theory (EuroCOLT '95), held in Barcelona, Spain in March 1995. The book contains full vers… Mehr…

Nr. 978-3-540-49195-8. Versandkosten:Worldwide free shipping, , DE. (EUR 0.00)
zuklappen (X)
3
Computational Learning Theory - Paul Vitanyi
Bestellen
bei Springer.com
€ 71,39
Versand: € 0,001
Bestellen
Details beim Anbieter
gesponserter Link
Paul Vitanyi:
Computational Learning Theory - neues Buch

ISBN: 9783540491958

Computer Science; Artificial Intelligence (incl. Robotics); Mathematical Logic and Formal Languages; Algorithm Analysis and Problem Complexity Algorithms, algorithm, evolutionary algorith… Mehr…

  - Versandkosten: EUR 0.00
zuklappen (X)
4
Computational Learning Theory - Paul Vitanyi
Bestellen
bei Springer.com
€ 71,39
Bestellen
Details und Versand
gesponserter Link
Paul Vitanyi:
Computational Learning Theory - neues Buch

ISBN: 9783540491958

Computer Science; Artificial Intelligence (incl. Robotics); Mathematical Logic and Formal Languages; Algorithm Analysis and Problem Complexity Algorithms, algorithm, evolutionary algorith… Mehr…

  - Versandkosten:zzgl. Versandkosten.
zuklappen (X)
5
Computational Learning Theory - Paul Vitanyi
Bestellen
bei Springer.com
€ 71,39
Bestellen
Details und Versand
gesponserter Link
Paul Vitanyi:
Computational Learning Theory - neues Buch

ISBN: 9783540491958

Computer Science; Artificial Intelligence (incl. Robotics); Mathematical Logic and Formal Languages; Algorithm Analysis and Problem Complexity Algorithms, algorithm, evolutionary algorith… Mehr…

  - Versandkosten:zzgl. Versandkosten.
zuklappen (X)
1Da einige Plattformen keine Versandkonditionen übermitteln und diese vom Lieferland, dem Einkaufspreis, dem Gewicht und der Größe des Artikels, einer möglichen Mitgliedschaft der Plattform, einer direkten Lieferung durch die Plattform oder über einen Drittanbieter (Marketplace), etc. abhängig sein können, ist es möglich, dass die von eurobuch angegebenen Versandkosten nicht mit denen der anbietenden Plattform übereinstimmen.

Bibliographische Daten des bestpassenden Buches

Details zum Buch
Computational Learning Theory
Autor:
Titel:
ISBN-Nummer:

9783540491958

Detailangaben zum Buch - Computational Learning Theory


EAN (ISBN-13): 9783540491958
Herausgeber: Springer Science+Business Media

Buch in der Datenbank seit 2017-02-04T22:44:23+01:00 (Berlin)
Detailseite zuletzt geändert am 2024-01-31T14:35:49+01:00 (Berlin)
ISBN/EAN: 9783540491958

ISBN - alternative Schreibweisen:
978-3-540-49195-8
Alternative Schreibweisen und verwandte Suchbegriffe:
Titel des Buches: learning

Daten vom Verlag:

Autor/in: Paul Vitanyi
Titel: Lecture Notes in Computer Science; Lecture Notes in Artificial Intelligence; Computational Learning Theory - Second European Conference, EuroCOLT '95, Barcelona, Spain, March 13 - 15, 1995. Proceedings
Verlag: Springer; Springer Berlin
422 Seiten
Erscheinungsjahr: 2005-07-05
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
55,00 € (AT)
59,00 CHF (CH)
Available
XVIII, 422 p.

EA; E107; eBook; Nonbooks, PBS / Informatik, EDV/Informatik; Künstliche Intelligenz; Verstehen; Algorithms; algorithm; evolutionary algorithm; learning; learning theory; logic; machine learning; programming; robot; robotics; algorithm analysis and problem complexity; C; Artificial Intelligence; Formal Languages and Automata Theory; Algorithms; Computer Science; Theoretische Informatik; Algorithmen und Datenstrukturen; BC

The discovery of algorithmic probability: A guide for the programming of true creativity.- A desicion-theoretic generalization of on-line learning and an application to boosting.- Online learning versus offline learning.- Learning distributions by their density levels — A paradigm for learning without a teacher.- Tight worst-case loss bounds for predicting with expert advice.- On-line maximum likelihood prediction with respect to general loss functions.- The power of procrastination in inductive inference: How it depends on used ordinal notations.- Learnability of Kolmogorov-easy circuit expressions via queries.- Trading monotonicity demands versus mind changes.- Learning recursive functions from approximations.- On the intrinsic complexity of learning.- The structure of intrinsic complexity of learning.- Kolmogorov numberings and minimal identification.- Stochastic complexity in learning.- Function learning from interpolation (extended abstract).- Approximation and learning of convex superpositions.- Minimum description length estimators under the optimal coding scheme.- MDL learning of unions of simple pattern languages from positive examples.- A note on the use of probabilities by mechanical learners.- Characterizing rational versus exponential learning curves.- Is pocket algorithm optimal?.- Some theorems concerning the free energy of (Un) constrained stochastic Hopfield neural networks.- A space-bounded learning algorithm for axis-parallel rectangles.- Learning decision lists and trees with equivalence-queries.- Bounding VC-dimension for neural networks: Progress and prospects.- Average case analysis of a learning algorithm for ?-DNF expressions.- Learning by extended statistical queries and its relation to PAC learning.- Typed pattern languages and theirlearnability.- Learning behaviors of automata from shortest counterexamples.- Learning of regular expressions by pattern matching.- The query complexity of learning some subclasses of context-free grammars.
< zum Archiv...