INGO WEGENER THEORETISCHE INFORMATIK 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: Voodoogal Faezilkree
Country: Lebanon
Language: English (Spanish)
Genre: Medical
Published (Last): 15 January 2012
Pages: 459
PDF File Size: 16.82 Mb
ePub File Size: 11.93 Mb
ISBN: 349-9-97244-596-8
Downloads: 2853
Price: Free* [*Free Regsitration Required]
Uploader: Sacage

Trier 1 Trier 2. Technical University of Dortmund, Germany. Martin DietzfelbingerJonathan E.

Theoretische Informatik 1, WiSe 16/17

RoweIngo WegenerPhilipp Woelfel: Precision, Local Search and Unimodal Functions. Precision, local search and unimodal functions. Tight Bounds for Blind Search on the Integers. Detecting high-order interactions of single nucleotide polymorphisms using genetic programming.

Ingo Wegener theoertische, Philipp Woelfel: Computational Complexity 16 3: Frank NeumannIngo Wegener: Randomized local search, evolutionary algorithms, and the minimum spanning tree problem. Thomas JansenIngo Wegener: A comparison of simulated annealing with a simple evolutionary algorithm on pseudo-boolean functions of unitation.

On the analysis of a dynamic evolutionary algorithm. Discrete Algorithms 4 1: Minimum spanning trees made easier inforrmatik multi-objective optimization. Natural Computing 5 3: Modified repeated median filters.

Statistics and Computing 16 2: Oliver GielIngo Wegener: Maximum cardinality matchings on trees by randomized local search. Complexity theory – exploring the limits of efficient algorithms. SpringerISBNpp. Ingo WegenerCarsten Witt: Real royal road functions–where crossover provably is essential.

  GRUNDFOS UP 20-45 N 150 PDF

Discrete Applied Mathematics Thomas JansenKenneth A. De JongIngo Wegener: Evolutionary Computation 13 4: On the influence of the variable ordering for algorithmic learning using OBDDs.

Wegener, Ingo

Warum, wie und durch wen?. Informatik Spektrum 28 2: On the analysis of a simple evolutionary algorithm on quadratic pseudo-boolean functions.

Discrete Algorithms 3 1: Simon FischerIngo Wegener: The one-dimensional Ising model: BDDs–design, analysis, complexity, and applications. The analysis of evolutionary algorithms on sorting and shortest paths problems.

Tobias StorchIngo Wegener: Real royal road functions for constant population size. Logic versus Approximation The Ising Model on the Ring: Simple Evolutionary Algorithms as Adaptation Schemes. Searching Randomly for Maximum Matchings. Grenzen der Effizienz von Algorithmen. SpringerISBN [contents].

Beate BolligIngo Wegener: Functions that have read-once branching programs of quadratic size are not necessarily testable.

The analysis of a recombinative hill-climber on H-IFF. Evolutionary Computation 7 5: Towards a Theory of Randomized Search Heuristics. Evolutionary Algorithms and the Maximum Matching Problem. Informatik Spektrum 25 6: A simplified correctness proof for a well-known algorithm computing strongly connected components. How to analyse evolutionary algorithms.

Books by Ingo Wegener

Optimization with randomized search heuristics – the A NFL theorem, realistic scenarios, and difficult functions. Philipp KerstingIngo Wegener: Informatica Didactica 2 Teaching Nondeterminism as a Special Theoretiische of Randomization. Informatica Didactica 4 Detlef SielingIngo Wegener: Formal Methods in System Design 19 3: Evolutionary algorithms – how to cope with plateaus wegner constant fitness and when to reject strings of the same fitness.

Evolutionary Computation 5 6: Theoretical Aspects of Evolutionary Algorithms.

  JAVAD NURBAKHSH PDF

Branching Programs and Binary Decision Diagrams. TeubnerISBN Optimal ordered binary decision diagrams for read-once formulas. Worst case examples for operations on OBDDs. Jawahar JainK. Analysis of composition complexity and how to obtain smaller canonical graphs.

Juraj HromkovicIngo Wegener: Workshop on Boolean Functions and Applications. Stefan EdelkampIngo Wegener: Approximability and Nonapproximability by Binary Decision Diagrams. Stasys JuknaAlexander A. Computational Complexity 8 4: Discrete Applied Mathematics 91 On the complexity of the hidden weighted bit function for various BDD models. Approximations by OBDDs and the variable ordering problem.

Evolutionary Computation 6 2: Formal Methods in System Design 13 3: Bounds on the Number of Knight’s Tours. Discrete Applied Mathematics 74 2: Bundeswettbewerb Informatik – Die Aufgaben der Endrunden und LOG IN 17 6: Kompendium Theoretische Informatik – eine Ideensammlung. On the Complexity of Encoding in Analog Circuits. Martin SauerhoffIngo Wegener: On the complexity of minimizing the OBDD size for incompletely specified functions.

Optimal attribute-efficient learning of disjunction, parity, and threshold functions. Informatik Spektrum 18 2: Solution of the knight’s Hamiltonian path problem on chessboards. Discrete Applied Mathematics 50 2: Efficient data structures for Boolean functions. Discrete Mathematics