The following pages link to Ingo Wegener (Q171935):
Displaying 50 items.
- A simplified correctness proof for a well-known algorithm computing strongly connected components. (Q1853027) (← links)
- How to analyse evolutionary algorithms. (Q1853459) (← links)
- Optimization with randomized search heuristics -- the (A)NFL theorem, realistic scenarios, and difficult functions. (Q1853460) (← links)
- On the nonapproximability of Boolean functions by OBDDs and read-\(k\)-times branching programs (Q1854567) (← links)
- The number of knight's tours equals 33, 439, 123, 484, 294---counting with binary decision diagrams (Q1909973) (← links)
- Exact OBDD bounds for some fundamental functions (Q1959388) (← links)
- Real royal road functions -- where crossover provably is essential (Q2387434) (← links)
- Upper and lower bounds for randomized search heuristics in black-box optimization (Q2432545) (← links)
- A comparison of simulated annealing with a simple evolutionary algorithm on pseudo-Boolean functions of unitation (Q2455595) (← links)
- On the analysis of a dynamic evolutionary algorithm (Q2466004) (← links)
- New results on the complexity of the middle bit of multiplication (Q2474204) (← links)
- On the influence of the variable ordering for algorithmic learning using OBDDs (Q2568437) (← links)
- The one-dimensional Ising model: mutation versus recombination (Q2575079) (← links)
- On converting CNF to DNF (Q2576880) (← links)
- A very simple function that requires exponential size read-once branching programs. (Q2583538) (← links)
- (Q2728854) (← links)
- (Q2754143) (← links)
- (Q2766663) (← links)
- Dynamic parameter control in simple evolutionary algorithms (Q2776420) (← links)
- (Q3031933) (← links)
- (Q3081627) (← links)
- (Q3081628) (← links)
- Complexity Theory (Q3156942) (← links)
- (Q3202956) (← links)
- (Q3221885) (← links)
- The construction of an optimal distribution of search effort (Q3320110) (← links)
- The discrete search problem and the construction of optimal allocations (Q3321817) (← links)
- (Q3334079) (← links)
- (Q3335688) (← links)
- (Q3343922) (← links)
- (Q3357542) (← links)
- (Q3359743) (← links)
- (Q3535299) (← links)
- (Q3659518) (← links)
- (Q3679109) (← links)
- (Q3686422) (← links)
- (Q3691584) (← links)
- The critical complexity of all (monotone) boolean functions and monotone graph properties (Q3716300) (← links)
- Optimal decision trees and one-time-only branching programs for symmetric Boolean functions (Q3722429) (← links)
- (Q3757396) (← links)
- (Q3762226) (← links)
- (Q3770269) (← links)
- (Q3775483) (← links)
- (Q3782781) (← links)
- Search problems. Transl. from the German by Jean E. Wotschke (Q3792452) (← links)
- On the complexity of branching programs and decision trees for clique functions (Q3798243) (← links)
- (Q3807127) (← links)
- (Q3821577) (← links)
- (Q3835841) (← links)
- (Q3861131) (← links)
