Produktart
Zustand
Einband
Weitere Eigenschaften
Gratisversand
Land des Verkäufers
Verkäuferbewertung
Verlag: Wiesbaden, Teubner, 2006
ISBN 10: 3835100785ISBN 13: 9783835100787
Anbieter: Antiquariat Bookfarm, Löbnitz, Deutschland
Buch Erstausgabe
Softcover. 1. Auflage. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. Ex-library with stamp and library-signature. GOOD condition, some traces of use. AB-8004 9783835100787 Sprache: Deutsch Gewicht in Gramm: 550.
Verlag: Wiesbaden, Vieweg+Teubner Verlag, 2004
ISBN 10: 351910332XISBN 13: 9783519103325
Anbieter: Antiquariat Bookfarm, Löbnitz, Deutschland
Buch
339 S. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. Ex-library with stamp and library-signature. GOOD condition, some traces of use. so7923 9783519103325 Sprache: Deutsch Gewicht in Gramm: 900 2., überarbeitete und erweiterte Auflage.
Mehr Angebote von anderen Verkäufern bei ZVAB
Gebraucht ab EUR 8,20
Verlag: Wiesbaden, Vieweg+Teubner, 2010
ISBN 10: 3834810045ISBN 13: 9783834810045
Anbieter: Antiquariat Bookfarm, Löbnitz, Deutschland
Buch
Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. Ex-library with stamp and library-signature. GOOD condition, some traces of use. so7984 9783834810045 Sprache: Deutsch Gewicht in Gramm: 900.
ISBN 10: 3264845458ISBN 13: 9783264845457
Anbieter: medimops, Berlin, Deutschland
Buch
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.
Verlag: Springer, 2009
ISBN 10: 3540859853ISBN 13: 9783540859857
Anbieter: WorldofBooks, Goring-By-Sea, WS, Vereinigtes Königreich
Buch
Hardback. Zustand: Very Good. The book has been read, but is in excellent condition. Pages are intact and not marred by notes or highlighting. The spine remains undamaged.
Mehr Angebote von anderen Verkäufern bei ZVAB
Neu ab EUR 59,55
Gebraucht ab EUR 47,54
Mehr entdecken Hardcover
Verlag: Springer Berlin Heidelberg, 1997
ISBN 10: 354057459XISBN 13: 9783540574590
Anbieter: Buchpark, Trebbin, Deutschland
Buch
Zustand: Sehr gut. Zustand: Sehr gut - Gepflegter, sauberer Zustand.
Mehr Angebote von anderen Verkäufern bei ZVAB
Neu ab EUR 56,69
Gebraucht ab EUR 10,71
Mehr entdecken Hardcover
Verlag: Springer Fachmedien Wiesbaden, 2014
ISBN 10: 365804831XISBN 13: 9783658048310
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Buch
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Dieses Lehrbuch ermöglicht einen begeisterten Einstieg ins Programmieren ab 10 Jahren. Programmierunterricht wird dabei als Förderung der konstruktiven Lösungsfähigkeit und der exakten Kommunikation zur Steuerung eines Computers verstanden. Die Schüler entdecken und entwickeln die Programmiersprache selbstständig mit und lernen, Aufgaben systematisch zu lösen. Beginnend mit einzelnen Anweisungen werden einfache Programme spielerisch eingeführt. Das Buch zeichnet sich aus durch seine detaillierten Erklärungen und anschaulichen Darstellungen. Die Programmierumgebung sowie die Arbeitshefte für den Unterricht stehen kostenlos zum Download zur Verfügung.
Verlag: Springer, 2002
ISBN 10: 3540441344ISBN 13: 9783540441342
Anbieter: suspiratio - online bücherstube, Basel, Schweiz
Buch
Hardcover. Zustand: Gut. 2. Auflage. sehr guter Zustand. nur kleiner hick am cover, A-622.
Mehr Angebote von anderen Verkäufern bei ZVAB
Neu ab EUR 95,80
Gebraucht ab EUR 31,00
Mehr entdecken Hardcover
Verlag: Springer Vieweg, 2014
ISBN 10: 3658064323ISBN 13: 9783658064327
Anbieter: Studibuch, Stuttgart, Deutschland
Buch
paperback. Zustand: Sehr gut. 368 Seiten; 9783658064327.2 Sprache: Deutsch Gewicht in Gramm: 1.
Mehr Angebote von anderen Verkäufern bei ZVAB
Neu ab EUR 59,99
Gebraucht ab EUR 29,70
Mehr entdecken Softcover
Verlag: Springer Berlin Heidelberg, 2007
ISBN 10: 3540748709ISBN 13: 9783540748700
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Buch
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book constitutes the refereed proceedings of the 4th International Symposium on Stochastic Algorithms: Foundations and Applications, SAGA 2007. The nine revised full papers and five invited papers presented were carefully selected for inclusion in the book. The contributed papers included in this volume cover both theoretical as well as applied aspects of stochastic computations with a special focus on investigating the power of randomization in algorithmics.
Verlag: Springer Berlin Heidelberg, 2010
ISBN 10: 3642081851ISBN 13: 9783642081859
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Buch
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - The communication complexity of two-party protocols is an only 15 years old complexity measure, but it is already considered to be one of the fundamen tal complexity measures of recent complexity theory. Similarly to Kolmogorov complexity in the theory of sequential computations, communication complex ity is used as a method for the study of the complexity of concrete computing problems in parallel information processing. Especially, it is applied to prove lower bounds that say what computer resources (time, hardware, memory size) are necessary to compute the given task. Besides the estimation of the compu tational difficulty of computing problems the proved lower bounds are useful for proving the optimality of algorithms that are already designed. In some cases the knowledge about the communication complexity of a given problem may be even helpful in searching for efficient algorithms to this problem. The study of communication complexity becomes a well-defined indepen dent area of complexity theory. In addition to a strong relation to several funda mental complexity measures (and so to several fundamental problems of com plexity theory) communication complexity has contributed to the study and to the understanding of the nature of determinism, nondeterminism, and random ness in algorithmics. There already exists a non-trivial mathematical machinery to handle the communication complexity of concrete computing problems, which gives a hope that the approach based on communication complexity will be in strumental in the study of several central open problems of recent complexity theory.
Verlag: Springer Berlin Heidelberg, 2010
ISBN 10: 3642056482ISBN 13: 9783642056482
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Buch
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Preface Due to the development of hardware technologies (such as VLSI) in the early 1980s, the interest in parallel and distributive computing has been rapidly growingandinthelate1980sthestudyofparallelalgorithmsandarchitectures became one of the main topics in computer science. To bring the topic to educatorsandstudents,severalbooksonparallelcomputingwerewritten. The involvedtextbook'IntroductiontoParallelAlgorithmsandArchitectures'by F. Thomson Leighton in 1992 was one of the milestones in the development of parallel architectures and parallel algorithms. But in the last decade or so the main interest in parallel and distributive computing moved from the design of parallel algorithms and expensive parallel computers to the new distributive reality - the world of interconnected computers that cooperate (often asynchronously) in order to solve di erent tasks. Communication became one of the most frequently used terms of computer science because of the following reasons: (i) Considering the high performance of current computers, the communi- tion is often moretime consuming than the computing time of processors. As a result, the capacity of communication channels is the bottleneck in the execution of many distributive algorithms. (ii) Many tasks in the Internet are pure communication tasks. We do not want to compute anything, we only want to execute some information - change or to extract some information as soon as possible and as cheaply as possible. Also, we do not have a central database involving all basic knowledge. Instead, wehavea distributed memorywherethe basickno- edgeisdistributedamongthelocalmemoriesofalargenumberofdi erent computers. The growing importance of solving pure communication tasks in the - terconnected world is the main motivation forwriting this book.
Verlag: Springer Berlin Heidelberg, 2004
ISBN 10: 3540241329ISBN 13: 9783540241324
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Buch
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - During its 30-year existence, the International Workshop on Graph-Theoretic Concepts in Computer Science has become a distinguished and high-quality computer science event. The workshop aims at uniting theory and practice by demonstrating how graph-theoretic concepts can successfully be applied to v- ious areas of computer science and by exposing new theories emerging from applications. In this way, WG provides a common ground for the exchange of information among people dealing with several graph problems and working in various disciplines. Thereby, the workshop contributes to forming an interdis- plinary research community. The original idea of the Workshop on Graph-Theoretic Concepts in C- puter Science was ingenuity in all theoretical aspects and applications of graph concepts, wherever applied. Within the last ten years, the development has strengthened in particular the topic of structural graph properties in relation to computational complexity. This workshop has become pivotal for the c- munity interested in these areas.An aimspeci c to the 30thWG was to support the central role of WG in both of the prementioned areas on the one hand and on the other hand to promote its originally broader scope. The 30th WG was held at the Physikzentrum Bad Honnef, which serves as the main meeting point of the German Physical Society. It o ers a secluded setting for research conferences, seminars, and workshops, and has proved to be especiallystimulatingforfruitful discussions.Talksweregiveninthenewlecture hall with a modern double rear projection, interactive electronic board, and full video conferencing equipment.
Verlag: Springer Berlin Heidelberg, 2014
ISBN 10: 3642426069ISBN 13: 9783642426063
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Buch
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - The rst and foremost goal of this lecture series was to show the beauty, depth and usefulness of the key ideas in computer science. While working on the lecture notes, we came to understand that one can recognize the true spirit of a scienti c discipline only by viewing its contributions in the framework of science as a whole. We present computer science here as a fundamental science that, interacting with other scienti c disciplines, changed and changes our view on the world, that contributes to our understanding of the fundamental concepts of science and that sheds new light on and brings new meaning to several of these concepts. We show that computer science is a discipline that discovers spectacular, unexpected facts, that nds ways out in seemingly unsolvable s- uations, and that can do true wonders. The message of this book is that computer science is a fascinating research area with a big impact on the real world, full of spectacular ideas and great ch- lenges. It is an integral part of science and engineering with an above-average dynamic over the last 30 years and a high degree of interdisciplinarity. The goal of this book is not typical for popular science writing, whichoftenrestrictsitselftooutliningtheimportanceofaresearch area. Whenever possible we strive to bring full understanding of the concepts and results presented.
Verlag: Springer Berlin Heidelberg, 2010
ISBN 10: 3642079091ISBN 13: 9783642079092
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Buch
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Algorithmic design, especially for hard problems, is more essential for success in solving them than any standard improvement of current computer tech nologies. Because of this, the design of algorithms for solving hard problems is the core of current algorithmic research from the theoretical point of view as well as from the practical point of view. There are many general text books on algorithmics, and several specialized books devoted to particular approaches such as local search, randomization, approximation algorithms, or heuristics. But there is no textbook that focuses on the design of algorithms for hard computing tasks, and that systematically explains, combines, and compares the main possibilities for attacking hard algorithmic problems. As this topic is fundamental for computer science, this book tries to close this gap. Another motivation, and probably the main reason for writing this book, is connected to education. The considered area has developed very dynami cally in recent years and the research on this topic discovered several profound results, new concepts, and new methods. Some of the achieved contributions are so fundamental that one can speak about paradigms which should be in cluded in the education of every computer science student. Unfortunately, this is very far from reality. This is because these paradigms are not sufficiently known in the computer science community, and so they are insufficiently com municated to students and practitioners.
Verlag: Springer Berlin Heidelberg, 2003
ISBN 10: 3540140158ISBN 13: 9783540140153
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Buch
Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - The aim of this textbook is not only to provide an elegant route through the theoretical fundamentals of computer science, but also to show that theoretical computer science is a fascinating discipline, full of spectacular contributions and miracles, and depth in research, and yet directly applicable. Thus, we aim to excite people about its study. To achieve these goals we do not hesitate to take a lot of space to present motivations, and especially to give the informal development of crucial ideas and concepts and their transparent, but rigorous presentation.An additional aim is to present the development of the computer scientist's way of thinking, so we do not restrict this book to the classic areas like computability and automata theory but we also present fundamental concepts such as approximation and randomization in algorithmics and we explain the basic ideas of cryptography and interconnection network design.
Verlag: Springer Berlin Heidelberg, 2010
ISBN 10: 3642057292ISBN 13: 9783642057298
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Buch
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - The aim of this textbook is not only to provide an elegant route through the theoretical fundamentals of computer science, but also to show that theoretical computer science is a fascinating discipline, full of spectacular contributions and miracles, and depth in research, and yet directly applicable. Thus, we aim to excite people about its study. To achieve these goals we do not hesitate to take a lot of space to present motivations, and especially to give the informal development of crucial ideas and concepts and their transparent, but rigorous presentation.An additional aim is to present the development of the computer scientist's way of thinking, so we do not restrict this book to the classic areas like computability and automata theory but we also present fundamental concepts such as approximation and randomization in algorithmics and we explain the basic ideas of cryptography and interconnection network design.