Dorothea Wagner – författare
Visar alla böcker från författaren Dorothea Wagner. Handla med fri frakt och snabb leverans.
15 produkter
15 produkter
963 kr
Skickas inom 10-15 vardagar
Are you looking for new lectures for your course on algorithms, combinatorial optimization, or algorithmic game theory? This volume is aimed at readers with some familiarity of combinatorial optimization, and appeals to researchers, graduate students, and advanced undergraduate students alike.
697 kr
Skickas inom 10-15 vardagar
Are you looking for new lectures for your course on algorithms, combinatorial optimization, or algorithmic game theory? This volume is aimed at readers with some familiarity of combinatorial optimization, and appeals to researchers, graduate students, and advanced undergraduate students alike.
121 kr
Skickas inom 3-6 vardagar
384 kr
Skickas inom 10-15 vardagar
Die Gesellschaft fur Informatik (GI) zeichnet jedes Jahr eine Informatikdissertation durch einen Preis aus. Die Auswahl dieser Dissertation stutzt sich auf die von den Universitaten und Hochschulen fur diesen Preis vorgeschlagenen Dissertationen. Somit sind die Teilnehmer an dem Auswahlverfahren der GI bereits als "Preistrager" ihrer Hochschule ausgezeichnet.
Graph-Theoretic Concepts in Computer Science
26th International Workshop, WG 2000 Konstanz, Germany, June 15-17, 2000 Proceedings
Häftad, Engelska, 2000
554 kr
Skickas inom 10-15 vardagar
This book constitutes the thoroughly refereed post-workshop proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2000, held in Konstanz, Germany, in June 2000. The 26 revised full papers presented together with two invited contributions were carefully reviewed and selected from 51 submissions. The papers provide a wealth of new results for various classes of graphs, graph computations, graph algorithms and graph-theoretical applications in various fields.
538 kr
Skickas inom 10-15 vardagar
Graph drawing comprises all aspects of visualizing structural relations between objects. The range of topics dealt with extends from graph theory, graph algorithms, geometry, and topology to visual languages, visual perception, and information visualization, and to computer-human interaction and graphics design. This monograph gives a systematic overview of graph drawing and introduces the reader gently to the state of the art in the area. The presentation concentrates on algorithmic aspects, with an emphasis on interesting visualization problems with elegant solutions. Much attention is paid to a uniform style of writing and presentation, consistent terminology, and complementary coverage of the relevant issues throughout the 10 chapters.This tutorial is ideally suited as an introduction for newcomers to graph drawing. Ambitioned practitioners and researchers active in the area will find it a valuable source of reference and information.
Algorithm Engineering
4th International Workshop, WAE 2000 Saarbrücken, Germany, September 5-8, 2000 Proceedings
Häftad, Engelska, 2001
554 kr
Skickas inom 10-15 vardagar
This book constitutes the thoroughly refereed post-proceedings of the 4th International Workshop on Algorithm Engineering, WAE 2000, held in Saarbrucken, Germany in September 2000. The 19 revised full papers presented together with one invited paper were carefully reviewed and selected from a total of 30 submissions. Among the topics addressed are software repositories allowing for the use and experimentation with efficient discrete algorithms; novel uses of discrete algorithms; methodological issues on algorithms and data structures; and methodological issues on converting user requirements into efficient algorithmic and implementation solutions.
Graph Drawing
14th International Symposium, GD 2006, Karlsruhe, Germany, September 18-20, 2006, Revised Papers
Häftad, Engelska, 2007
538 kr
Skickas inom 10-15 vardagar
This book constitutes the thoroughly refereed post-proceedings of the 14th International Symposium on Graph Drawing, GD 2006, held in Karlsruhe, Germany. The 33 revised full papers and 5 revised short papers presented together with 2 invited talks, 1 system demo, 2 poster papers address all current aspects in graph drawing, ranging from foundational and methodological issues to applications for various classes of graphs in a variety of fields.
554 kr
Skickas inom 10-15 vardagar
This state-of-the-art survey features papers that were selected after an open call following the International Dagstuhl Seminar on Algorithmic Methods for Railway Optimization. The second part of the volume constitutes the refereed proceedings of the 4th International Workshop on Algorithmic Methods and Models for Optimization of Railways. The 17 full papers presented here were carefully reviewed and selected from numerous submissions.
751 kr
Skickas inom 10-15 vardagar
Thousands of mini computers (comparable to a stick of chewing gum in size), equipped with sensors, are deployed in some terrain or other. After activation the sensors form a self-organized network and provide data, for example about a forthcoming earthquake. The trend towards wireless communication increasingly affects electronic devices in almost every sphere of life. Conventional wireless networks rely on infrastructure such as base stations; mobile devices interact with these base stations in a client/server fashion. In contrast, current research is focusing on networks that are completely unstructured, but are nevertheless able to communicate (via several hops) with each other, despite the low coverage of their antennas. Such systems are called sensor or ad hoc networks, depending on the point of view and the application. Wireless ad hoc and sensor networks have gained an incredible research momentum. Computer scientists and engineers of all flavors are embracing the area. Sensor networks have been adopted by researchers in many fields: from hardware technology to operating systems, from antenna design to databases, from information theory to networking, from graph theory to computational geometry.
467 kr
Skickas inom 10-15 vardagar
Hinter vielen Programmen stecken clevere Verfahren, die man als Algorithmen bezeichnet. Algorithmen lösen nicht nur mathematische Aufgaben, die sich mit Zahlen beschäftigen, sondern auch andere, ganz alltägliche Problemstellungen, bei denen logischer Spürsinn, räumliche Orientierung oder geschicktes Verhandeln gefragt sind, beispielsweise: Wie sollten Seeräuber eine Schatzkarte aufteilen, bzw. Bankangestellte den Geheimcode des Tresors? Wie ermittle ich den kürzesten Weg zwischen zwei Orten? Wie kann ich einen Kuchen gerecht aufteilen? Dieses Buch vollführt einen Streifzug durch die faszinierende Welt der Algorithmen. Es verlangt keine Vorkenntnisse, so dass Schüler ab der Mittelstufe und Informatik-interessierte Laien neue und überraschende Einblicke gewinnen können. In 43 Artikeln von Informatikern, die an Universitäten im In- und Ausland lehren, werden besonders elegante Algorithmen anschaulich und umgangssprachlich erklärt, so dass die besondere Faszination der Informatik spürbar wird.
554 kr
Skickas inom 10-15 vardagar
A state-of-the-art survey that reports on the progress made in selected areas of this important and growing field, aiding the analysis of existing networks and the design of new and more efficient algorithms for solving various problems on these networks.
1 175 kr
Skickas inom 10-15 vardagar
Algorithms Unplugged presents 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.
Algorithms - ESA 2014
22th Annual European Symposium, Wrocław, Poland, September 8-10, 2014. Proceedings
Häftad, Engelska, 2014
538 kr
Skickas inom 10-15 vardagar
This book constitutes the refereed proceedings of the 22st Annual European Symposium on Algorithms, ESA 2014, held in Wrocław, Poland, in September 2014, as part of ALGO 2014. The 69 revised full papers presented were carefully reviewed and selected from 269 initial submissions: 57 out of 221 in Track A, Design and Analysis, and 12 out of 48 in Track B, Engineering and Applications. The papers present original research in the areas of design and mathematical analysis of algorithms; engineering, experimental analysis, and real-world applications of algorithms and data structures.
1 175 kr
Skickas inom 10-15 vardagar
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.