A rigorous complexity analysis of the (1 + 1)- evolution strategy for separable functions with boolean inputs
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
Reihe Computational Intelligence ; 6
- Klassifikation
-
Informatik
- Ereignis
-
Veröffentlichung
- (wo)
-
Dortmund
- (wer)
-
Universitätsbibliothek Dortmund
- (wann)
-
1998
- Urheber
- Handle
-
2003/5322
- URN
-
urn:nbn:de:101:1-201607145420
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 11:01 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Droste, Stefan
- Jansen, Thomas
- Wegener, Ingo
- Universitätsbibliothek Dortmund
Entstanden
- 1998
Ähnliche Objekte (12)
The complexity of Boolean functions
Proof Complexity of Quantified Boolean Formulas
Boolean function complexity : advances and frontiers
Complexity of Boolean functions : 31.10.1999 - 05.11.1999
Complexity of Boolean functions : 10.03. - 14.03.97
On the Complexity of Boolean Unification
A Proof Complexity View of Pseudo-Boolean Solving
The complexity of Boolean functions from cryptographic viewpoint
Complexity of Boolean functions : 06111 abstracts collection ; Dagstuhl seminar
Critical Properties and Complexity Measures of Read-Once Boolean Functions
The Complexity of Reasoning with Boolean Modal Logics : Extended Version
Simulated Annealing for Convex Optimization: Rigorous Complexity Analysis and Practical Perspectives
The complexity of Boolean functions
Proof Complexity of Quantified Boolean Formulas
Boolean function complexity : advances and frontiers
Complexity of Boolean functions : 31.10.1999 - 05.11.1999
Complexity of Boolean functions : 10.03. - 14.03.97
On the Complexity of Boolean Unification
A Proof Complexity View of Pseudo-Boolean Solving
The complexity of Boolean functions from cryptographic viewpoint
Complexity of Boolean functions : 06111 abstracts collection ; Dagstuhl seminar
Critical Properties and Complexity Measures of Read-Once Boolean Functions
The Complexity of Reasoning with Boolean Modal Logics : Extended Version
Simulated Annealing for Convex Optimization: Rigorous Complexity Analysis and Practical Perspectives
The complexity of Boolean functions
Proof Complexity of Quantified Boolean Formulas
Boolean function complexity : advances and frontiers
Complexity of Boolean functions : 31.10.1999 - 05.11.1999
Complexity of Boolean functions : 10.03. - 14.03.97
On the Complexity of Boolean Unification
A Proof Complexity View of Pseudo-Boolean Solving
The complexity of Boolean functions from cryptographic viewpoint
Complexity of Boolean functions : 06111 abstracts collection ; Dagstuhl seminar
Critical Properties and Complexity Measures of Read-Once Boolean Functions
The Complexity of Reasoning with Boolean Modal Logics : Extended Version