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,
The book features surveys on Combinatorics about topics such as intersection theorems, which are not yet covered in textbooks, several contributions by leading experts in data compression, and relations to Natural Sciences are discussed. BDDs–design, analysis, complexity, and applications.
Discrete Algorithms 3 1: Computational Complexity 8 4: The analysis of evolutionary algorithms on sorting and shortest paths problems. On the Complexity of Encoding in Analog Circuits.
Statistics and Computing 16 2: Evolutionary Theorretische 7 5: Searching Randomly for Maximum Matchings. On the analysis of a dynamic evolutionary algorithm.
RoweIngo WegenerPhilipp Woelfel: Natural Computing 5 3: Precision, local search and unimodal functions. Informatica Didactica 2 Theoretical and methodological investigations are complemented by prototypic applications for design and management tasks in electrical engineering, mechanical engineering, and chemical engineering. Beate BolligIngo Wegener: Approximations by OBDDs and the variable ordering problem. Real royal road functions–where crossover provably is essential.
Theoretische Informatik 1, WiSe 16/17
Surveys on topics of current interest are included as well as new research results. Evolutionary algorithms – how to cope with plateaus of constant fitness and when to reject strings of the same fitness.
Theoretischw Evolutionary Algorithms as Adaptation Schemes. Suchprobleme by Rudolf Ahlswede Book 8 editions published between and in German and Russian and held by 83 WorldCat member libraries worldwide.
On the complexity of minimizing the OBDD size for incompletely specified functions. The results described within have applications in verification, computer-aided design, model checking, and discrete mathematics. This book describes representations of Boolean functions that have small size for many important functions and which allow efficient work with the represented functions. A simplified correctness proof for a well-known algorithm computing strongly connected components. The complexity of symmetric functions in bounded-depth circuits by Bettina Brustmann Book 1 edition published in in German and held by 5 WorldCat member libraries worldwide.
Automata, Languages and Programming vol.
Evolutionary Computation 5 6: Technical University of Dortmund, Germany. How to analyse evolutionary algorithms. Optimal ordered binary decision diagrams for read-once formulas.
Highlights aus der Informatik: Computational Complexity 16 3: Search problems by Rudolf Ahlswede Book 13 fheoretische published between and in English and held by WorldCat member libraries worldwide Introductory remarks and definitions; A sample search model; Search problems with error-free tests; Binary search problems without restrictions on the tests; Alphabetic codes and binary search trees; Sorting problems; Weighting problems and geometric problems; Special search problems with error-free tests; Search problems having tests with chance errors; Stochastic approximation; Search problem having answers with chance errors and channels with feedback; Identification and ranking problems; Ino problems with inspections; Minimizing expected search costs; Infirmatik the probability of sucess with limited resources; More general models for search problems with inspection.
Formal Methods in System Design 19 3: Warum, wie und durch wen?.
Kompendium Theoretische Informatik – eine Ideensammlung: Ingo Wegener: : Books
Bundeswettbewerb Informatik – Die Aufgaben der Endrunden und Complexity theory – exploring the limits of efficient algorithms. Discrete Algorithms 4 1: On the complexity of the hidden weighted bit function for various BDD models.
The book provides complete coverage of the core issues in the field, lngo in fuzzy logic and control as well as for evolutionary optimization algorithms including genetic programming, in a comprehensive and systematic way. Logic versus Approximation Efficient data structures for Boolean functions. Tight Bounds for Blind Search on the Integers.
Books by Ingo Wegener
Detlef SielingIngo Wegener: Special attention was paid to the interplay between the fields. This book will become a valuable source of reference for researchers active in computational intelligence. SpringerISBNpp.
The topics selected have implications for concrete applications, and the significance of complexity theory for today’s computer science is stressed throughout. Tobias StorchIngo Wegener: Automata, languages and programming: Discrete Applied Mathematics 74 2: Optimal attribute-efficient learning of disjunction, parity, and threshold functions.
Formal Methods in System Design 13 3: English 99 German 50 Russian 5. Branching programs and binary decision diagrams:
Privacy & Cookies Policy
Necessary cookies are absolutely essential for the website to function properly. This category only includes cookies that ensures basic functionalities and security features of the website. These cookies do not store any personal information.