Kenty PDF

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: Tulabar Najinn
Country: France
Language: English (Spanish)
Genre: Sex
Published (Last): 10 July 2005
Pages: 324
PDF File Size: 8.79 Mb
ePub File Size: 7.94 Mb
ISBN: 603-6-95134-488-2
Downloads: 4447
Price: Free* [*Free Regsitration Required]
Uploader: Meztiramar

Logic versus Approximation English 99 German 50 Russian 5.

Books by Ingo Wegener

Philipp KerstingIngo Wegener: On the informatok of a simple evolutionary algorithm on quadratic pseudo-boolean functions. Special attention was paid to the interplay between the fields. Complexity theory – exploring the limits of efficient algorithms. Theoretical Aspects of Evolutionary Algorithms. The analysis of a recombinative hill-climber on H-IFF.

Warum, wie und durch wen?. Precision, local search and unimodal functions.

Wegener, Ingo

The topics selected have implications for concrete applications, and the significance of complexity theory for today’s computer science is stressed throughout. Formal Methods in System Design 13 3: On the Complexity of Encoding in Analog Circuits. Discrete Algorithms 4 1: Evolutionary algorithms – how to cope with plateaus of constant fitness and when to reject strings of the same fitness. Search problems by Rudolf Ahlswede Book 13 editions 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; Search problems with inspections; Minimizing expected search costs; Maximizing the probability of sucess with limited resources; More general models for search problems with inspection.


The one-dimensional Ising model: Informatik Spektrum 25 6: Optimal attribute-efficient learning of disjunction, parity, and threshold functions. Discrete Applied Mathematics 50 2: Thomas JansenKenneth A. Searching Randomly for Maximum Matchings. Technical University of Dortmund, Germany. Bounds on the Number of Knight’s Tours. Optimal ordered binary decision diagrams for read-once formulas. Simple Evolutionary Algorithms as Adaptation Schemes. The book provides complete coverage of the core issues in the field, especially in fuzzy logic and control as well as for evolutionary optimization algorithms including genetic programming, in a comprehensive and systematic way.

Optimization with randomized search heuristics – the A NFL theorem, realistic scenarios, and difficult functions. Modified repeated median filters. Evolutionary Computation 7 5: SpringerISBN [contents]. Minimum spanning trees made easier via multi-objective optimization.

Books by Ingo Wegener (Author of The Complexity of Boolean Functions)

Theoretical and methodological investigations are complemented by prototypic applications theoregische design and management tasks in electrical engineering, mechanical engineering, and chemical engineering. Advanced students and professionals interested wefener learning about and applying advanced techniques of computational intelligence will appreciate the book as a useful guide enhanced by numerous examples and applications in a variety of fields.


Towards a Theory of Randomized Search Heuristics. Ingo Wegener deutscher Informatiker. Beate BolligIngo Wegener: Conference papers and proceedings.

Wegener, Ingo [WorldCat Identities]

Mit diesem Wissen sollte der rheoretische Einstieg ins Informatikstudium problemlos gelingen. Evolutionary Algorithms and the Maximum Matching Problem. 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. Stasys JuknaAlexander A.

Jawahar JainK.

How to analyse evolutionary algorithms. Theoretischd Applied Mathematics 91 Workshop on Boolean Functions and Applications. Oliver GielIngo Wegener: Automata, languages and programming: Surveys on topics of current interest are included as well as new research results.

Thomas JansenIngo Wegener: Suchprobleme by Rudolf Ahlswede Book 8 editions published between and in German and Russian and held by 83 WorldCat member libraries worldwide.

Approximability theorretische Nonapproximability by Binary Decision Diagrams. LOG IN 17 6: