03817oam 2200625 450 99646561410331620210722144650.01-280-80456-497866108045663-540-46769-610.1007/3-540-46769-6(CKB)1000000000211187(EBL)3036569(SSID)ssj0000288523(PQKBManifestationID)11231401(PQKBTitleCode)TC0000288523(PQKBWorkID)10381275(PQKB)10162948(DE-He213)978-3-540-46769-4(MiAaPQ)EBC3036569(MiAaPQ)EBC6489632(PPN)155189530(EXLCZ)99100000000021118720210722d1999 uy 0engur|n|---|||||txtccrAlgorithmic learning theory 10th International Conference, ALT'99, Tokyo, Japan, December 6-8, 1999 : proceedings /Osamu Watanabe, Takashi Yokomori, eds1st ed. 1999.Berlin, Germany ;New York, New York :Springer,[1999]©19991 online resource (374 p.)Lecture Notes in Artificial Intelligence ;1720Description based upon print version of record.3-540-66748-2 Includes bibliographical references and index.Invited Lectures -- Tailoring Representations to Different Requirements -- Theoretical Views of Boosting and Applications -- Extended Stochastic Complexity and Minimax Relative Loss Analysis -- Regular Contributions -- Algebraic Analysis for Singular Statistical Estimation -- Generalization Error of Linear Neural Networks in Unidentifiable Cases -- The Computational Limits to the Cognitive Power of the Neuroidal Tabula Rasa -- The Consistency Dimension and Distribution-Dependent Learning from Queries (Extended Abstract) -- The VC-Dimension of Subclasses of Pattern Languages -- On the V ? Dimension for Regression in Reproducing Kernel Hilbert Spaces -- On the Strength of Incremental Learning -- Learning from Random Text -- Inductive Learning with Corroboration -- Flattening and Implication -- Induction of Logic Programs Based on ?-Terms -- Complexity in the Case Against Accuracy: When Building One Function-Free Horn Clause Is as Hard as Any -- A Method of Similarity-Driven Knowledge Revision for Type Specializations -- PAC Learning with Nasty Noise -- Positive and Unlabeled Examples Help Learning -- Learning Real Polynomials with a Turing Machine -- Faster Near-Optimal Reinforcement Learning: Adding Adaptiveness to the E3 Algorithm -- A Note on Support Vector Machine Degeneracy -- Learnability of Enumerable Classes of Recursive Functions from “Typical” Examples -- On the Uniform Learnability of Approximations to Non-recursive Functions -- Learning Minimal Covers of Functional Dependencies with Queries -- Boolean Formulas Are Hard to Learn for Most Gate Bases -- Finding Relevant Variables in PAC Model with Membership Queries -- General Linear Relations among Different Types of Predictive Complexity -- Predicting Nearly as Well as the Best Pruning of a Planar Decision Graph -- On Learning Unions of Pattern Languages and Tree Patterns.Lecture Notes in Artificial Intelligence ;1720Machine learningCongressesComputer algorithmsCongressesMachine learningComputer algorithms006.3/1Watanabe Osamu1958-Yokomori TakashiALT'99MiAaPQMiAaPQUtOrBLWBOOK996465614103316Algorithmic Learning Theory771965UNISA03526nam 2200625 a 450 991014661800332120200520144314.03-540-37445-010.1007/11818502(CKB)1000000000283694(SSID)ssj0000315755(PQKBManifestationID)11230599(PQKBTitleCode)TC0000315755(PQKBWorkID)10254960(PQKB)10087141(DE-He213)978-3-540-37445-9(MiAaPQ)EBC3068134(PPN)123137403(EXLCZ)99100000000028369420060712d2006 uy 0engurnn#008mamaatxtccrAdvanced topics in exception handling techniques /Christophe Dony ... [et al.] (eds.)1st ed. 2006.Berlin ;New York Springerc20061 online resource (X, 301 p.)Lecture notes in computer science,0302-9743 ;4119LNCS sublibrary. SL 2, Programming and software engineering"We organized two ECOOP workshops ... in 2003 and 2004. This book is primarily an outcome of these two events"--P. vi."[Based on an] ECOOP workshop in 2000, in 2001 we published the first collection of papers on this topic (Advances in exception handling techniques ...)"--P. [v].3-540-37443-4 Includes bibliographical references and index.Programming languages -- Concurrency and operating systems -- Pervasive computing systems -- Requirements and specifications -- Engineering and experience.Modern software systems are becoming more complex in many ways and are having to cope with a growing number of abnormal situations which, in turn, are increasingly complex to handle. Exception handling is an essential part of software and system architectures and a crucial element in the tool-set that enables the building of resilient, robust and safe software systems. Two ECOOP workshops on exception handling were held in 2003 and 2005. This book is primarily an outcome of these two events - several workshop participants as well as a number of other leading researchers in the field were invited to contribute a chapter each. This book is composed of five parts; the first four deal with topics related to exception handling in the context of programming languages, concurrency and operating systems, pervasive computing systems, and requirements and specifications. The last part focuses on case studies, experimentation and qualitative comparisons. The 16 coherently written chapters by leading researchers competently address a wide range of issues in exception handling.Lecture notes in computer science ;4119.LNCS sublibrary.SL 2,Programming and software engineering.Exception handling techniquesComputer softwareDevelopmentCongressesSystem designCongressesObject-oriented programming (Computer science)CongressesComputer softwareDevelopmentSystem designObject-oriented programming (Computer science)005.3Dony Christophe600355MiAaPQMiAaPQMiAaPQBOOK9910146618003321Advanced topics in exception handling techniques4184613UNINA