Monografie
Toward a complexity theory for randomized search heuristics : black-box models
- Language
-
Englisch
- Notes
-
Saarbrücken, Universität des Saarlandes, Diss., 2011
- Identifier
-
1051432596
Subject
Komplexität ; Komplexitätstheorie ; Heuristik ; Blackbox ; Theoretische Informatik ; Algorithmus; Hochschulschrift
Contributor
- URN
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
26.01.2023, 1:53 PM CET
Object type
- Monografie
Associated
Other Objects (12)
Toward better computation models for modern machines
NP-hard networking problems : exact and approximate algorithms
Application of multiplicative weights update method in algorithmic game theory
Polynomially solvable cases of hypergraph transversal and related problems
Random combinatorial structures and randomized search heuristics
On efficiency and reliability in computer science
Verification of program computations
Sampling from discrete distributions and computing Fréchet distances
Multiple choice allocations with small maximum loads
Aufbereitung von Shapeanalyseausgaben zur Visualisierung der abstrakten Programmausführung
Parallel evaluation of algebraic circuits
Analysis of algorithms for online uni-directional conversion problems
Toward better computation models for modern machines
NP-hard networking problems : exact and approximate algorithms
Application of multiplicative weights update method in algorithmic game theory
Polynomially solvable cases of hypergraph transversal and related problems
Random combinatorial structures and randomized search heuristics
On efficiency and reliability in computer science
Verification of program computations
Sampling from discrete distributions and computing Fréchet distances
Multiple choice allocations with small maximum loads
Aufbereitung von Shapeanalyseausgaben zur Visualisierung der abstrakten Programmausführung
Parallel evaluation of algebraic circuits
Analysis of algorithms for online uni-directional conversion problems
Toward better computation models for modern machines
NP-hard networking problems : exact and approximate algorithms
Application of multiplicative weights update method in algorithmic game theory
Polynomially solvable cases of hypergraph transversal and related problems
Random combinatorial structures and randomized search heuristics
On efficiency and reliability in computer science
Verification of program computations
Sampling from discrete distributions and computing Fréchet distances
Multiple choice allocations with small maximum loads
Aufbereitung von Shapeanalyseausgaben zur Visualisierung der abstrakten Programmausführung
Parallel evaluation of algebraic circuits