Vöcking Berthold (53 results)

Condition: 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.

Condition: very good. Gut/Very good: Buch bzw. Schutzumschlag mit wenigen Gebrauchsspuren an Einband, Schutzumschlag oder Seiten. / Describes a book or dust jacket that does show some signs of wear on either the binding, dust jacket or pages.

Softcover. Condition: Bon. Ancien livre de bibliothèque avec équipements. Edition 2008. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Good. Former library book. Edition 2008. Ammareal gives back up to 15% of this item's net price to charity organizations.

Condition: New.

Paperback. Condition: New.

Condition: New. In.

Condition: very good. Gut/Very good: Buch bzw. Schutzumschlag mit wenigen Gebrauchsspuren an Einband, Schutzumschlag oder Seiten. / Describes a book or dust jacket that does show some signs of wear on either the binding, dust jacket or pages.

Condition: New. pp. 284.

Paperback. Condition: Brand New. 2013 edition. 290 pages. 9.50x6.25x0.75 inches. In Stock.

Condition: New.

Condition: New.

Condition: Very Good. Former library copy. Pages intact with possible writing/highlighting. Binding strong with minor wear. Dust jackets/supplements may not be included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.

Condition: As New. Unread book in perfect condition.

Taschenbuch. Condition: Neu. Neuware -This book constitutes the proceedings of the 6th International Symposium on Algorithmic Game Theory, SAGT 2013, held in Aachen, Germany, in October 2013. The 25 papers presented in this volume were carefully reviewed and selected from 65 submissions. They cover various important aspects of algorithmic game theory, such as solution concepts in game theory, efficiency of equilibria and the price of anarchy, computational aspects of equilibria and game theoretical measures, repeated games and convergence of dynamics, evolution and learning in games, coordination and collective action, network games and graph-theoretic aspects of social networks, voting and social choice, as well as algorithmic mechanism design.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 284 pp. Englisch.

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book constitutes the proceedings of the 6th International Symposium on Algorithmic Game Theory, SAGT 2013, held in Aachen, Germany, in October 2013. The 25 papers presented in this volume were carefully reviewed and selected from 65 submissions. They cover various important aspects of algorithmic game theory, such as solution concepts in game theory, efficiency of equilibria and the price of anarchy, computational aspects of equilibria and game theoretical measures, repeated games and convergence of dynamics, evolution and learning in games, coordination and collective action, network games and graph-theoretic aspects of social networks, voting and social choice, as well as algorithmic mechanism design.

Condition: New.

Condition: New. In.

Condition: Sehr gut. Zustand: Sehr gut | Seiten: 284 | Sprache: Englisch | Produktart: Bücher | Keine Beschreibung verfügbar.

Condition: New. pp. 355.

Condition: New. pp. 416.

Taschenbuch. Condition: Neu. Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 416 pp. Englisch.

Buch. Condition: Neu. Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 416 pp. Englisch.

Paperback. Condition: New.

Taschenbuch. Condition: 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. Condition: 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.

Paperback. Condition: Like New. Like New. book.

Condition: New. In.

Condition: New.

Condition: As New. Unread book in perfect condition.

Condition: New. pp. x + 448.