|
|
|
|
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 | Timo Kötzing, Frank Neumann, Heiko Röglin, Carsten Witt |
Theoretical analysis of two ACO approaches for the traveling salesman problem.  |
Swarm Intelligence  |
2012 |
DBLP DOI 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, Johannes Lengler, Timo Kötzing, Carola Winzen |
Black-box complexities of combinatorial problems. |
GECCO |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Timo Kötzing, Dirk Sudholt, Madeleine Theile |
How crossover helps in pseudo-boolean optimization. |
GECCO |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Timo Kötzing, Frank Neumann, Reto Spöhel |
PAC learning and genetic programming. |
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 | John Case, Timo Kötzing |
Measuring Learning Complexity with Criteria Epitomizers. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Timo Kötzing, Frank Neumann, Dirk Sudholt, Markus Wagner |
Simple max-min ant systems and the optimization of linear pseudo-boolean functions. |
FOGA |
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 | Timo Kötzing |
Iterative Learning from Positive Data and Counters. |
ALT |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Timo Kötzing, Frank Neumann, Dirk Sudholt, Markus Wagner |
Simple Max-Min Ant Systems and the Optimization of Linear Pseudo-Boolean Functions |
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, Daniel Johannsen, Timo Kötzing, Frank Neumann, Madeleine Theile |
More Effective Crossover Operators for the All-Pairs Shortest Path Problem. |
PPSN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Timo Kötzing, Per Kristian Lehre, Frank Neumann, Pietro Simone Oliveto |
Ant colony optimization and the minimum cut problem. |
GECCO |
2010 |
DBLP DOI BibTeX RDF |
ant colony optimization, min-cut |
| 1 | Anna Kasprzik, Timo Kötzing |
String Extension Learning Using Lattices. |
LATA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Timo Kötzing, Frank Neumann, Heiko Röglin, Carsten Witt |
Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem. |
ANTS Conference |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | John Case, Timo Kötzing |
Solutions to Open Questions for Non-U-Shaped Learning with Memory Limitations. |
ALT |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | John Case, Timo Kötzing |
Strongly Non-U-Shaped Learning Results by General Techniques. |
COLT |
2010 |
DBLP BibTeX RDF |
|
| 1 | John Case, Timo Kötzing |
Difficulties in Forcing Fairness of Polynomial Time Inductive Inference. |
ALT |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | John Case, Timo Kötzing |
Dynamically Delayed Postdictive Completeness and Consistency in Learning. |
ALT |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | John Case, Timo Kötzing |
Dynamic Modeling in Inductive Inference. |
ALT |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | John Case, Timo Kötzing, Todd Paddock |
Feasible Iteration of Feasible Learning Functionals. |
ALT |
2007 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #22 of 22 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")