reischuk rüdiger (46 Ergebnisse)

Brosch., 410 S., Tabelle, Abbl., Zust. gut.

8° kart. Zustand: Gut. 2., völlig neubearb. und erw. Aufl. XVII, 353 S. Ausgetragenes Bibliotheksexemplar, Deckel mit Knicken, Seiten sehr gut erhalten B02-04-06H Sprache: Deutsch Gewicht in Gramm: 574.

8° kart. Zustand: Sehr gut. 2., völlig neubearb. und erw. Aufl. XVII, 353 S. Ausgetragenes Bibliotheksexemplar, mit einzelnen leichten Gebrauchsspuren MIG-30-06C Sprache: Deutsch Gewicht in Gramm: 574.

Zustand: good. Befriedigend/Good: Durchschnittlich erhaltenes Buch bzw. Schutzumschlag mit Gebrauchsspuren, aber vollständigen Seiten. / Describes the average WORN book or dust jacket that has all the pages present.

Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. Ex-library with stamp and library-signature. GOOD condition, some traces of use. so7945 9783540609223 Sprache: Englisch Gewicht in Gramm: 900.

Zustand: New. In.

Zustand: New. In.

Zustand: New. In.

2., völlig neubearb. und erw. Aufl. XVII, 353 S. Broschur. 2. Auflage. Versand aus Deutschland / We dispatch from Germany via Air Mail. Einband bestoßen, daher Mängelexemplar gestempelt, sonst sehr guter Zustand. Imperfect copy due to slightly bumped cover, apart from this in very good condition. Stamped. Sprache: Deutsch.

broschiert/Taschenbuch. XVII, 412 S. (23 cm) OKt. 1. Aufl. N.a.SchT.; sonst guter Zustand. ISBN 3519022753.

Paperback. Zustand: Brand New. revised edition. 440 pages. 9.20x6.10x0.94 inches. In Stock.

Zustand: New.

Zustand: New. Invited Talks.- The Complexity of Querying External Memory and Streaming Data.- The Smoothed Analysis of Algorithms.- Path Coupling Using Stopping Times.- Circuits.- On the Incompressibility of Monotone DNFs.- Bounds on the Power of Constant-Depth Quantum C.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This volume contains the papers presented at the 13th Annual Conference on Algorithmic Learning Theory (ALT 2002), which was held in Lub eck (Germany) during November 24-26, 2002. The main objective of the conference was to p- vide an interdisciplinary forum discussing the theoretical foundations of machine learning as well as their relevance to practical applications. The conference was colocated with the Fifth International Conference on Discovery Science (DS 2002). The volume includes 26 technical contributions which were selected by the program committee from 49 submissions. It also contains the ALT 2002 invited talks presented by Susumu Hayashi (Kobe University, Japan) on 'Mathematics Based on Learning', by John Shawe-Taylor (Royal Holloway University of L- don, UK) on 'On the Eigenspectrum of the Gram Matrix and Its Relationship to the Operator Eigenspectrum', and by Ian H. Witten (University of Waikato, New Zealand) on 'Learning Structure from Sequences, with Applications in a Digital Library' (joint invited talk with DS 2002). Furthermore, this volume - cludes abstracts of the invited talks for DS 2002 presented by Gerhard Widmer (Austrian Research Institute for Arti cial Intelligence, Vienna) on 'In Search of the Horowitz Factor: Interim Report on a Musical Discovery Project' and by Rudolf Kruse (University of Magdeburg, Germany) on 'Data Mining with Graphical Models'. The complete versions of these papers are published in the DS 2002 proceedings (Lecture Notes in Arti cial Intelligence, Vol. 2534). ALT has been awarding the E.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book constitutes the thoroughly refereed proceedings of the 39th International Workshop on Graph Theoretic Concepts in Computer Science, WG 2013, held in Lübeck, Germany, in June 2013. The 34 revised full papers presented were carefully reviewed and selected from 61 submissions. The book also includes two abstracts. The papers cover a wide range of topics in graph theory related to computer science, such as structural graph theory with algorithmic or complexity applications; design and analysis of sequential, parallel, randomized, parameterized and distributed graph and network algorithms; computational complexity of graph and network problems; computational geometry; graph grammars, graph rewriting systems and graph modeling; graph drawing and layouts; random graphs and models of the web and scale-free networks; and support of these concepts by suitable implementations and applications.

Taschenbuch. Zustand: Neu. Algorithmic Learning Theory | 13th International Conference, ALT 2002, Lübeck, Germany, November 24-26, 2002, Proceedings | Nicolò Cesa-Bianchi (u. a.) | Taschenbuch | Einband - flex.(Paperback) | Englisch | 2002 | Springer | EAN 9783540001706 | Verantwortliche Person für die EU: Springer Nature Customer Service Center GmbH, Europaplatz 3, 69115 Heidelberg, productsafety[at]springernature[dot]com | Anbieter: preigu.

Taschenbuch. Zustand: Neu. Graph-Theoretic Concepts in Computer Science | 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers | Andreas Brandstädt (u. a.) | Taschenbuch | xx | Englisch | 2013 | Springer | EAN 9783642450426 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.

Softcover. Zustand: Gut. Gebraucht - Gut Zustand: Gut, XI, 415 p. About this book This book constitutes the refereed proceedings of the 13th International Conference on Algorithmic Learning Theory, ALT 2002, held in Lübeck, Germany in November 2002. The 26 revised full papers presented together with 5 invited contributions and an introduction were carefully reviewed and selected from 49 submissions. The papers are organized in topical sections on learning Boolean functions, boosting and margin-based learning, learning with queries, learning and information extraction, inductive inference, inductive logic programming, language learning, statistical learning, and applications and heuristics. Written for research and development professionals.

Zustand: New. In.

Zustand: New. In.

Zustand: New. In.

Taschenbuch. Zustand: Neu. Neuware - This volume is dedicated to the 15th Symposium on Fundamentals of Com- tation Theory FCT 2005, held in Lu beck, Germany, on August 17 20, 2005. The FCT symposium was established in 1977 as a biennial event for - searchers interested in all aspects of theoretical computer science, in particular in algorithms, complexity, and formal and logical methods. The previous FCT conferences were held in the following places: Poznan (Poland, 1977),Wendisch- Rietz (Germany, 1979), Szeged (Hungary, 1981), Borgholm (Sweden, 1983), Cottbus(Germany,1985),Kazan(Russia,1987),Szeged(Hungary,1989),Gosen- Berlin (Germany, 1991), Szeged (Hungary, 1993), Dresden (Germany, 1995), Krak ow (Poland, 1997), Iasi (Romania, 1999), Riga (Latvia, 2001) and Malmo (Sweden, 2003). The FCT conference seriesis coordinatedby a steering comm- tee. Its current members are B. Chlebus (Denver/Warsaw),Z. Esik (Szeged), M. Karpinski (Bonn), A. Lingas (Lund), M. Santha (Paris), E. Upfal (Providence) and I. Wegener (Dortmund). The call for papers for FCT 2005 sought contributions on original research in all aspects of theoretical computer science including design and analysis of algorithms, abstract data types, approximation algorithms, automata and formal languages, categorical and topological approaches, circuits, computational and structural complexity, circuit and proof theory, computational biology, com- tational geometry, computer systems theory, concurrency theory, cryptography, domain theory, distributed algorithms and computation, molecular computation, quantumcomputation and information, granular computation, probabilistic c- putation, learning theory, rewriting, semantics, logic in computer science, spe- cation, transformation and veri cation, and algebraic aspects of computer s- ence.

Taschenbuch. Zustand: Neu. STACS 96 | 13th Annual Symposium on Theoretical Aspects of Computer Science, Grenoble, France, February 22-24, 1996. Proceedings | Claude Puech (u. a.) | Taschenbuch | xii | Englisch | 1996 | Springer | EAN 9783540609223 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.

Taschenbuch. Zustand: Neu. STACS 97 | 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27 - March 1, 1997 Proceedings | Rüdiger Reischuk (u. a.) | Taschenbuch | xv | Englisch | 1997 | Springer | EAN 9783540626169 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book constitutes the refereed proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science, STACS 97, held in Lübeck, Germany, in February/March 1997.The 46 revised full papers included were carefully selected from a total of 139 submissions; also included are three invited full papers. The papers presented span the whole scope of theoretical computer science. Among the topics covered are, in particular, algorithms and data structures, computational complexity, automata and formal languages, structural complexity, parallel and distributed systems, parallel algorithms, semantics, specification and verification, logic, computational geometry, cryptography, learning and inductive inference.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book constitutes the refereed proceedings of the 13th Symposium on Theoretical Aspects of Computer Science, STACS 96, held in Grenoble, France in February 1996.The 52 revised papers presented were selected from a total of 185 submissions; also included are three invited papers. The volume addresses all current aspects of theoretical computer science and is organized in sections on complexity theory, automata theory, parallel algorithms, learning, parallel and distributed systems, cryptography, logic and database theory, algorithms, semantics and program verification, and communication complexity.

Taschenbuch. Zustand: Neu. Algorithms Unplugged | Berthold Vöcking (u. a.) | Taschenbuch | x | Englisch | 2016 | Springer | EAN 9783662506004 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Algorithms specify the way computers process information and how they execute tasks. Many recent technological innovations and achievements rely on algorithmic ideas - they facilitate new applications in science, medicine, production, logistics, traffic, communi cation and entertainment. Efficient algorithms not only enable your personal computer to execute the newest generation of games with features unimaginable only a few years ago, they are also key to several recent scientific breakthroughs - for example, the sequencing of the human genome would not have been possible without the invention of new algorithmic ideas that speed up computations by several orders of magnitude. The greatest improvements in the area of algorithms rely on beautiful ideas for tackling computational tasks more efficiently. The problems solved are not restricted to arithmetic tasks in a narrow sense but often relate to exciting questions of nonmathematical flavor, such as: How can I find the exit out of amaze How can I partition a treasure map so that the treasure can only be found if all parts of the map are recombined How should I plan my trip to minimize cost Solving these challenging problems requires logical reasoning, geometric and combinatorial imagination, and, last but not least, creativity - the skills needed for the design and analysis of algorithms.In this book we present some of the most beautiful algorithmic ideas in 41 articles written in colloquial, nontechnical language. Most of the articles arose out of an initiative among German-language universities to communicate the fascination of algorithms and computer science to high-school students. The book can be understood without any prior knowledge of algorithms and computing, and it will be an enlightening and fun read for students and interested adults.

Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Algorithms specify the way computers process information and how they execute tasks. Many recent technological innovations and achievements rely on algorithmic ideas - they facilitate new applications in science, medicine, production, logistics, traffic, communi cation and entertainment. Efficient algorithms not only enable your personal computer to execute the newest generation of games with features unimaginable only a few years ago, they are also key to several recent scientific breakthroughs - for example, the sequencing of the human genome would not have been possible without the invention of new algorithmic ideas that speed up computations by several orders of magnitude. The greatest improvements in the area of algorithms rely on beautiful ideas for tackling computational tasks more efficiently. The problems solved are not restricted to arithmetic tasks in a narrow sense but often relate to exciting questions of nonmathematical flavor, such as: How can I find the exit out of amaze How can I partition a treasure map so that the treasure can only be found if all parts of the map are recombined How should I plan my trip to minimize cost Solving these challenging problems requires logical reasoning, geometric and combinatorial imagination, and, last but not least, creativity - the skills needed for the design and analysis of algorithms.In this book we present some of the most beautiful algorithmic ideas in 41 articles written in colloquial, nontechnical language. Most of the articles arose out of an initiative among German-language universities to communicate the fascination of algorithms and computer science to high-school students. The book can be understood without any prior knowledge of algorithms and computing, and it will be an enlightening and fun read for students and interested adults.

Zustand: New. In.