48 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. Evolutionary Algorithms for Quantum Computers.
14. How Single Ant ACO Systems Optimize Pseudo-Boolean Functions.
15. Rigorous analyses of fitness-proportional selection for optimizing linear functions.
16. Refined runtime analysis of a basic ant colony optimization algorithm.
17. Adjacency list matchings: an ideal genotype for cycle covers.
18. Expanders Are Universal for the Class of All Spanning Trees.
19. More effective crossover operators for the all-pairs shortest path problem.
20. Multiplicative Drift Analysis.
21. Non-existence of linear universal drift functions.
22. Optimising Spatial and Tonal Data for PDE-based Inpainting.
23. Micropolar plasticity. Part II: a v.Mises version of micropolar plasticity in terms of curvature tensors related by mixed transformations
24. Micropolar plasticity—Part I: modeling based on curvature tensors related by mixed transformations
25. More Effective Crossover Operators for the All-Pairs Shortest Path Problem
26. Multiplicative Drift Analysis
27. Non-Existence of Linear Universal Drift Functions
28. Faster Black-Box Algorithms Through Higher Arity Operators
29. Counting Defective Parking Functions.
30. 2. Optimizing spatial and tonal data for PDE-based inpainting
31. Evolutionary Algorithms for Quantum Computers
32. An SQL-Based Query Language and Engine for Graph Pattern Matching
33. Non-existence of linear universal drift functions
34. Expanders are universal for the class of all spanning trees
35. More Effective Crossover Operators for the All-Pairs Shortest Path Problem
36. Expanders Are Universal for the Class of All Spanning Trees (Extended Abstract)
37. Optimising Spatial and Tonal Data for Homogeneous Diffusion Inpainting
38. Evolutionary Computation in Combinatorial Optimization
39. Can quantum search accelerate evolutionary algorithms?
40. Edge-based representation beats vertex-based representation in shortest path problems
41. Vertices of Degree k in Random Maps
42. More Effective Crossover Operators for the All-Pairs Shortest Path Problem
43. Solving SAT for CNF Formulas with a One-Sided Restriction on Variable Occurrences
44. Theory and Applications of Satisfiability Testing - SAT 2009
45. Refined runtime analysis of a basic ant colony optimization algorithm
46. Adjacency list matchings
47. Rigorous analyses of fitness-proportional selection for optimizing linear functions
48. Counting defective parking functions
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.