|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 2 occurrences of 2 keywords
|
|
|
|
|
Results
Found 22 publication records. Showing 22 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Benjamin Doerr, Carola Winzen |
Memory-restricted black-box complexity of OneMax.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Gnewuch, Magnus Wahlström, Carola Winzen |
A New Randomized Algorithm to Approximate the Star Discrepancy Based on Threshold Accepting. |
SIAM J. Numerical Analysis |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Carola Winzen |
Reducing the Arity in Unbiased Black-Box Complexity |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Benjamin Doerr, Carola Winzen |
Playing Mastermind With Constant-Size Memory. |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Carola Winzen |
Memory-Restricted Black-Box Complexity. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Benjamin Doerr, Daniel Johannsen, Carola Winzen |
Multiplicative Drift Analysis |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Benjamin Doerr, Timo Kötzing, Johannes Lengler, Carola Winzen |
Black-Box Complexities of Combinatorial Problems |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Benjamin Doerr, Carola Winzen |
Towards a Complexity Theory of Randomized Search Heuristics: Ranking-Based Black-Box Complexity |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Benjamin Doerr, Carola Winzen |
Playing Mastermind With Constant-Size Memory |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Carola Winzen |
Direction-Reversing Quasi-Random Rumor Spreading with Restarts |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Michael Gnewuch, Magnus Wahlström, Carola Winzen |
A Randomized Algorithm Based on Threshold Accepting to Approximate the Star Discrepancy |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Benjamin Doerr, Carola Winzen |
Towards a Complexity Theory of Randomized Search Heuristics: Ranking-Based Black-Box Complexity. |
CSR |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Johannes Lengler, Timo Kötzing, Carola Winzen |
Black-box complexities of combinatorial problems. |
GECCO |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Timo Kötzing, Carola Winzen |
Too fast unbiased black-box algorithms. |
GECCO |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Daniel Johannsen, Timo Kötzing, Per Kristian Lehre, Markus Wagner, Carola Winzen |
Faster black-box algorithms through higher arity operators. |
FOGA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Daniel Johannsen, Carola Winzen |
Non-Existence of Linear Universal Drift Functions |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Benjamin Doerr, Thomas Jansen, Dirk Sudholt, Carola Winzen, Christine Zarges |
Optimizing Monotone Functions Can Be Difficult |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Benjamin Doerr, Daniel Johannsen, Timo Kötzing, Per Kristian Lehre, Markus Wagner, Carola Winzen |
Faster Black-Box Algorithms Through Higher Arity Operators |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Benjamin Doerr, Thomas Jansen, Dirk Sudholt, Carola Winzen, Christine Zarges |
Optimizing Monotone Functions Can Be Difficult. |
PPSN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Daniel Johannsen, Carola Winzen |
Multiplicative drift analysis. |
GECCO |
2010 |
DBLP DOI BibTeX RDF |
theory, running time analysis |
| 1 | Benjamin Doerr, Daniel Johannsen, Carola Winzen |
Drift analysis and linear functions revisited. |
IEEE Congress on Evolutionary Computation |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Gnewuch, Anand Srivastav, Carola Winzen |
Finding optimal volume subintervals with k points and calculating the star discrepancy are NP-hard problems. |
J. Complexity |
2009 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #22 of 22 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")