Gadong Taohy


Jan. (Eine elektronische Version dieses Buches ist frei verfügbar). I. Wegener. Theoretische Informatik – eine algorithmenorientierte Einführung. Ingo Wegener has expertise in Engineering and Psychology. dass die genannten Gebiete der theoretischen Informatik ganz konkrete Anwendungen haben. Homepage der Vorlesung Theoretische Informatik 1, WS / Akademischer Verlag, ; Ingo Wegener, Theoretische Informatik, Teubner,

Author: Zolot Fegami
Country: Saint Lucia
Language: English (Spanish)
Genre: Spiritual
Published (Last): 25 July 2006
Pages: 142
PDF File Size: 16.73 Mb
ePub File Size: 12.94 Mb
ISBN: 566-9-18537-860-9
Downloads: 57324
Price: Free* [*Free Regsitration Required]
Uploader: Jukinos

Branching programs and binary decision diagrams: Evolutionary Computation 7 5: This is the only book to investigate the representation size of Boolean functions and efficient algorithms on these representations.

Kompendium Theoretische Informatik – eine Ideensammlung: Ingo Wegener: : Books

Functions that have read-once branching programs of quadratic size are not necessarily testable. Maximum cardinality matchings on trees by randomized local search. Juraj HromkovicIngo Wegener: Stefan EdelkampIngo Wegener: The topics selected have implications for concrete applications, and the significance of complexity theory for today’s computer science theoertische stressed throughout. The analysis of a recombinative hill-climber on H-IFF. On the Complexity of Encoding in Analog Circuits.


Evolutionary algorithms inngo how to cope with plateaus of constant fitness and when to reject strings of the same fitness. Analysis of composition complexity and how to obtain smaller canonical graphs. Worst case examples for operations on OBDDs.

This book is the first comprehensive description of theory and applications.

Thomas JansenIngo Wegener: Bounds on the Number of Knight’s Tours. Research areas like complexity theory, efficient algorithms, data structures, and discrete mathematics will benefit from the theory described in this book. On the analysis of a dynamic evolutionary algorithm.

Randomized local search, evolutionary algorithms, and the minimum spanning tree problem. Simple Evolutionary Algorithms as Adaptation Schemes.

The one-dimensional Ising thoretische English 99 German 50 Russian 5. Advances in computational intelligence: Workshop on Boolean Functions and Applications.

BDDs–design, analysis, complexity, and applications. Suchprobleme by Rudolf Ahlswede Book 8 editions published between and in German and Russian and held by 83 WorldCat member libraries worldwide.


Beate BolligIngo Wegener: New branches of complexity theory continue to arise in response to new algo-rithmic concepts, and its results – such as the theory of NP-completeness – have influenced the development of all areas of computer science. Optimization with randomized search heuristics – the A NFL theorem, realistic scenarios, and difficult functions.

Books by Ingo Wegener

Ingo WegenerPhilipp Woelfel: Simon FischerIngo Wegener: Martin DietzfelbingerJonathan E. The analysis of evolutionary algorithms on sorting and shortest paths problems.

Highlights aus der Informatik: Warum, wie und durch wen?. RoweIngo WegenerPhilipp Woelfel: Discrete Applied Mathematics 91 Theoretical and methodological investigations are complemented by prototypic applications for design and management tasks in electrical engineering, mechanical engineering, and chemical engineering.