16 results on '"Daniel Johannsen"'
Search Results
2. Expanders are universal for the class of all spanning trees.
3. Runtime analysis of the (1+1) evolutionary algorithm on strings over finite alphabets.
4. Faster black-box algorithms through higher arity operators.
5. Optimising Spatial and Tonal Data for Homogeneous Diffusion Inpainting.
6. More Effective Crossover Operators for the All-Pairs Shortest Path Problem.
7. Drift analysis and linear functions revisited.
8. Can quantum search accelerate evolutionary algorithms?
9. Edge-based representation beats vertex-based representation in shortest path problems.
10. Multiplicative drift analysis.
11. Vertices of Degree k in Random Maps.
12. Solving SAT for CNF Formulas with a One-Sided Restriction on Variable Occurrences.
13. How Single Ant ACO Systems Optimize Pseudo-Boolean Functions.
14. Rigorous analyses of fitness-proportional selection for optimizing linear functions.
15. Refined runtime analysis of a basic ant colony optimization algorithm.
16. Adjacency list matchings: an ideal genotype for cycle covers.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.