|
71 |
Randomized local search, evolutionary algorithms, and the minimum spanning tree problem Neumann, Frank. - Dortmund : Universitätsbibliothek Dortmund, 2004
|
|
|
72 |
Approximation and Randomized Algorithms in Communication Networks (Dagstuhl Seminar 02251) Bampis, Evripidis. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2003
|
|
|
73 |
Optimal Convergence Rate of the Randomized Algorithms of Stochastic Approximation in Arbitrary Noise Enthalten in Automation and remote control Bd. 64, Nr. 2, date:2.2003: 252-262
|
|
|
74 |
Beating the Logarithmic Lower Bound: Randomized Preemptive Disjoint Paths and Call Control Algorithms Enthalten in Journal of scheduling Bd. 6, Nr. 2, date:3.2003: 113-129
|
|
|
75 |
Design and Analysis of Randomized and Approximation Algorithms (Dagstuhl Seminar 01231) Dyer, Martin. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2002
|
|
|
76 |
Randomized pivot algorithms for P-matrix linear complementarity problems Enthalten in Mathematical programming Bd. 92, Nr. 2, date:4.2002: 285-296
|
|
|
77 |
Randomized Algorithms for Stochastic Approximation under Arbitrary Disturbances Enthalten in Automation and remote control Bd. 63, Nr. 2, date:2.2002: 209-219
|
|
|
78 |
Optimal Parallel Randomized Algorithms for the Voronoi Diagram of Line Segments in the Plane Enthalten in Algorithmica Bd. 33, Nr. 4, date:08.2002: 436-460
|
|
|
79 |
Randomized Algorithms: Approximation, Generation and Counting London : Springer London, 2001
|
|
|
80 |
Efficient Randomized Algorithms for the Repeated Median Line Estimator Enthalten in Algorithmica Bd. 20, Nr. 2, date:2.1998: 136-150
|
|