Angebote zu "Algorithmen" (298 Treffer)

Musikgenerierung mit Evolutionären Algorithmen
49,00 € *
ggf. zzgl. Versand

Evolutionäre Algorithmen (EA´s) versprechen große Erfolge im Bereich der automatischen Musikgenerierung. Dieser Erfolg liegt nicht nur daran, dass Musik als Optimierungsproblem angesehen werden kann und EA´s daher prädestiniert sind, sondern auch an der Tatsache, dass evolutionäre Prozesse ähnlich dem natürlichen, kreativen Schaffensprozess sind. Der Hauptschwerpunkt bei der automatischen Generierung von Musik liegt in der Implementierung einer Funktion, die die Güte der Ergebnisse evaluiert. Die vorliegende Arbeit setzt sich besonders mit automatischen und interaktiven Fitnessfunktionen auseinander und will zeigen, dass oft ein einfaches Regelwerk genügt um komplexe, kreative Systeme zu erstellen.

Anbieter: buecher.de
Stand: 16.07.2019
Zum Angebot
Algorithmen und Problemlösungen mit C++
44,99 € *
ggf. zzgl. Versand

So lernen Sie Programmiermethoden wie auch algorithmische und mathematische Konzepte in Zusammenhang mit C++-spezifischen Elementen verstehen und beispielhaft anwenden. Doina Logofatu präsentiert sorgfältig ausgewählte Problemstellungen, die dem Leser den Übergang vom konkreten Praxisbeispiel zur allgemeinen Theorie erleichtern. Den Schwerpunkt bilden praktische Anwendungsbeispiele, die von der Analyse bis zum C++-Programm komplett behandelt werden. Jedes Problem ist eine Fallstudie mit Beispielen, Analogien und detaillierten Erklärungen, ergänzt um entsprechend geeignete Übungen. Zu jedem gelösten Problem wird ein komplettes Listing des Programms zusammen mit einem repräsentativen Input- und Output-Datenset geliefert. ´´Algorithmen und Problemlösungen mit C++´´ empfiehlt sich sowohl als Lern- und Arbeitsbuch für das Selbststudium wie auch für die direkte Verwendung in der Lehre. Die zweite Auflage des erfolgreichen Buches wurde unter Berücksichtigung zahlreicher Leserstimmen überarbeitet und erweitert. Ergänzt wurden u. a. klassische Themen und Probleme wie Huffman-Kodierung, Kruskal- und LCS-Algorithmus sowie Sudoku aus der Spieltheorie. ´´Studenten geraten nicht gerade ins Schwärmen angesichts staubtrockener akademischer Produkte [...]. Dass es auch ganz anders geht, beweist Logofatus Buch, das bereits 2001 in Rumänien erschienen ist und das die Verfasserin nun selbst übersetzt und erweitert hat. Statt abgeschmackter Such- und Sortieralgorithmen enthält es interessante und anspruchsvolle Algorithmen aus der diskreten Mathematik [...]. Das unterhaltsame Buch regt auch zum Knobeln und Experimentieren an.´´ c´t magazin für computer und technik, 6/2007

Anbieter: buecher.de
Stand: 16.07.2019
Zum Angebot
Algorithms on Strings, Trees and Sequences
60,99 € *
ggf. zzgl. Versand

Describes a range of string problems in computer science and molecular biology and the algorithms developed to solve them.

Anbieter: buecher.de
Stand: 16.07.2019
Zum Angebot
Exact Exponential Algorithms
56,99 € *
ggf. zzgl. Versand

For a long time computer scientists have distinguished between fast and slow algo rithms. Fast (or good) algorithms are the algorithms that run in polynomial time, which means that the number of steps required for the algorithm to solve a problem is bounded by some polynomial in the length of the input. All other algorithms are slow (or bad). The running time of slow algorithms is usually exponential. This book is about bad algorithms. There are several reasons why we are interested in exponential time algorithms. Most of us believe that there are many natural problems which cannot be solved by polynomial time algorithms. The most famous and oldest family of hard problems is the family of NP complete problems. Most likely there are no polynomial time al gorithms solving these hard problems and in the worst case scenario the exponential running time is unavoidable. Every combinatorial problem is solvable in ?nite time by enumerating all possi ble solutions, i. e. by brute force search. But is brute force search always unavoid able? De?nitely not. Already in the nineteen sixties and seventies it was known that some NP complete problems can be solved signi?cantly faster than by brute force search. Three classic examples are the following algorithms for the TRAVELLING SALESMAN problem, MAXIMUM INDEPENDENT SET, and COLORING.

Anbieter: buecher.de
Stand: 16.07.2019
Zum Angebot
The Algorithm Design Manual
69,54 € *
ggf. zzgl. Versand

This newly expanded and updated second edition of the best-selling classic continues to take the ´´mystery´´ out of designing algorithms, and analyzing their efficacy and efficiency. Expanding on the first edition, the book now serves as the primary textbook of choice for algorithm design courses while maintaining its status as the premier practical reference guide to algorithms for programmers, researchers, and students. The reader-friendly Algorithm Design Manual provides straightforward access to combinatorial algorithms technology, stressing design over analysis. The first part, Techniques , provides accessible instruction on methods for designing and analyzing computer algorithms. The second part, Resources , is intended for browsing and reference, and comprises the catalog of algorithmic resources, implementations and an extensive bibliography. NEW to the second edition: - Doubles the tutorial material and exercises over the first edition - Provides full online support for lecturers, and a completely updated and improved website component with lecture slides, audio and video - Contains a unique catalog identifying the 75 algorithmic problems that arise most often in practice, leading the reader down the right path to solve them - Includes several NEW ´´war stories´´ relating experiences from real-world applications - Provides up-to-date links leading to the very best algorithm implementations available in C, C++, and Java

Anbieter: buecher.de
Stand: 16.07.2019
Zum Angebot
The Algorithm Design Manual
52,99 € *
ggf. zzgl. Versand

This expanded and updated second edition of a classic bestseller continues to take the ´´mystery´´ out of designing and analyzing algorithms and their efficacy and efficiency. Expanding on the highly successful formula of the first edition, the book now serves as the primary textbook of choice for any algorithm design course while maintaining its status as the premier practical reference guide to algorithms. NEW: (1) Incorporates twice the tutorial material and exercises. (2) Provides full online support for lecturers, and a completely updated and improved website component with lecture slides, audio and video. (3) Contains a highly unique catalog of the 75 most important algorithmic problems. (4) Includes new ´´war stories´´ and ´´interview problems´´, relating experiences from real-world applications. Written by a well-known, IEEE Computer Science teaching-award winner, this new edition is an essential learning tool for students needing a solid grounding in algorithms, as well as a uniquely comprehensive text/reference for professionals. This newly expanded and updated second edition of the best-selling classic continues to take the ´´mystery´´ out of designing algorithms, and analyzing their efficacy and efficiency. Expanding on the first edition, the book now serves as the primary textbook of choice for algorithm design courses while maintaining its status as the premier practical reference guide to algorithms for programmers, researchers, and students. The reader-friendly Algorithm Design Manual provides straightforward access to combinatorial algorithms technology, stressing design over analysis. The first part, Techniques , provides accessible instruction on methods for designing and analyzing computer algorithms. The second part, Resources , is intended for browsing and reference, and comprises the catalog of algorithmic resources, implementations and an extensive bibliography. NEW to the second edition: - Doubles the tutorial material and exercises over the first edition - Provides full online support for lecturers, and a completely updated and improved website component with lecture slides, audio and video - Contains a unique catalog identifying the 75 algorithmic problems that arise most often in practice, leading the reader down the right path to solve them - Includes several NEW ´´war stories´´ relating experiences from real-world applications - Provides up-to-date links leading to the very best algorithm implementations available in C, C++, and Java

Anbieter: buecher.de
Stand: 16.07.2019
Zum Angebot
An Introduction to the Analysis of Algorithms
51,99 € *
ggf. zzgl. Versand

Despite growing interest in the mathematical analysis of algorithms, basic information on methods and models has rarely been directly accessible to practitioners, researchers, or students. This book organizes and presents that knowledge, fully introducing today´s primary techniques for mathematically analyzing algorithms. Robert Sedgewick and the late Philippe Flajolet have drawn from both classical mathematical and computer science material, integrating discrete mathematics, elementary real analysis, combinatorics, algorithms, and data structures. They focus on ´´average-case´´ or ´´probabilistic´´ analysis, while also covering tools for ´´worst case´´ or ´´complexity´´ analysis. Improvements in this edition include: * Upgraded figures and code * Newer style for presenting much of the text´s math * An all-new chapter on trees This book´s thorough, self-contained coverage will help readers appreciate the field´s challenges, prepare them for advanced results covered in Donald Knuth´s books, and provide the background they need to keep abreast of new research. Coverage includes: recurrences, generating functions, asymptotics, trees, strings, maps, sorting, tree search, string search, and hashing algorithms. Ideal for junior- or senior-level courses on mathematical analysis of algorithms, this book will also be useful in courses on discrete mathematics for computer scientists, and in introducing mathematics students to computer science principles related to algorithms and data structures. Product Description Despite growing interest, basic information on methods and models for mathematically analyzing algorithms has rarely been directly accessible to practitioners, researchers, or students. An Introduction to the Analysis of Algorithms, Second Edition, organizes and presents that knowledge, fully introducing primary techniques and results in the field. Robert Sedgewick and the late Philippe Flajolet have drawn from both classical mathematics and computer science, integrating discrete mathematics, elementary real analysis, combinatorics, algorithms, and data structures. They emphasize the mathematics needed to support scientific studies that can serve as the basis for predicting algorithm performance and for comparing different algorithms on the basis of performance. Techniques covered in the first half of the book include recurrences, generating functions, asymptotics, and analytic combinatorics. Structures studied in the second half of the book include permutations, trees, strings, tries, and mappings. Numerous examples are included throughout to illustrate applications to the analysis of algorithms that are playing a critical role in the evolution of our modern computational infrastructure. Improvements and additions in this new edition include Upgraded figures and code Despite growing interest, basic information on methods and models for mathematically analyzing algorithms has rarely been directly accessible to practitioners, researchers, or students. An Introduction to the Analysis of Algorithms, Second Edition, organizes and presents that knowledge, fully introducing primary techniques and results in the field. Authors Robert Sedgewick and the late Philippe Flajolet emphasize the mathematics needed to support scientific studies that can serve as the basis for predicting algorithm performance and for comparing different algorithms on the basis of performance. Improvements and additions in this new edition include upgraded figures and code, an all-new chapter introducing analytic combinatorics, and simplified derivations via analytic combinatorics throughout. The book´s thorough, self-contained coverage will help readers appreciate the field´s challenges and prepare them for advanced study.

Anbieter: buecher.de
Stand: 16.07.2019
Zum Angebot
Death Algorithm and Other Digital Dilemmas
15,99 € *
ggf. zzgl. Versand

In The Death Algorithm and Other Digital Dilemmas, Roberto Simanowski wonders if we are on the brink of a society that views social, political, and ethical challenges as technological problems that can be fixed with the right algorithm, the best data, or the fastest computer. For example, the ´´death algorithm ¿ is programmed into a driverless car to decide, in an emergency, whether to plow into a group of pedestrians, a mother and child, or a brick wall. Can such life-and-death decisions no longer be left to the individual human? In these incisive essays, Simanowski asks us to consider what it means to be living in a time when the president of the United States declares the mainstream media to be an enemy of the people¿while Facebook transforms the people into the enemy of mainstream media. Simanowski describes smartphone zombies (or ´´smombies¿) who remove themselves from the physical world to the parallel universe of social media networks; calls on Adorno to help parse Trump´s tweeting; considers transmedia cannibalism, as written text is transformed into a postliterate object; compares the economic and social effects of the sharing economy to a sixteen-wheeler running over a plastic bottle on the road; and explains why philosophy mat become the most important element in the automotive and technology industries.

Anbieter: buecher.de
Stand: 16.07.2019
Zum Angebot
Algorithms and Data Structures
48,14 € *
ggf. zzgl. Versand

Algorithms are at the heart of every nontrivial computer application, and algorithmics is a modern and active area of computer science. Every computer scientist and every professional programmer should know about the basic algorithmic toolbox: structures that allow efficient organization and retrieval of data, frequently used algorithms, and basic techniques for modeling, understanding and solving algorithmic problems. This book is a concise introduction addressed to students and professionals familiar with programming and basic mathematical language. Individual chapters cover arrays and linked lists, hash tables and associative arrays, sorting and selection, priority queues, sorted sequences, graph representation, graph traversal, shortest paths, minimum spanning trees, and optimization. The algorithms are presented in a modern way, with explicitly formulated invariants, and comment on recent trends such as algorithm engineering, memory hierarchies, algorithm libraries and certifying algorithms. The authors use pictures, words and high-level pseudocode to explain the algorithms, and then they present more detail on efficient implementations using real programming languages like C++ and Java. The authors have extensive experience teaching these subjects to undergraduates and graduates, and they offer a clear presentation, with examples, pictures, informal explanations, exercises, and some linkage to the real world. Most chapters have the same basic structure: a motivation for the problem, comments on the most important applications, and then simple solutions presented as informally as possible and as formally as necessary. For the more advanced issues, this approach leads to a more mathematical treatment, including some theorems and proofs. Finally, each chapter concludes with a section on further findings, providing views on the state of research, generalizations and advanced solutions.

Anbieter: buecher.de
Stand: 16.07.2019
Zum Angebot