|
241 |
Stochastic analysis of partitioning algorithms for matching problems
Rüschendorf, Ludger. - Freiburg [Breisgau] : Albert-Ludwigs-Univ., Math. Fak., 1999
|
|
|
|
242 |
A unifying framework for design and analysis of matching algorithms
Fremuth-Paeger, Christian. - Augsburg : Inst. für Mathematik, 1997
|
|
|
|
243 |
Fundamental algorithms for a declarative pattern matching system
Kurtz, Stefan. - Bielefeld : Techn. Fak. der Univ. Bielefeld, Abt. Informationstechnik, 1995
|
|
|
|
244 |
Using the PROSET-Linda prototyping language for investigating MIMD algorithms for model matching in 3-D computer vision
Hasselbring, Wilhelm. - Dortmund : Dekanat Informatik, Univ., [1995]
|
|
|
245 |
Test driving three 1995 genetic algorithms: New test functions and geometric matching
Enthalten in Journal of heuristics Bd. 1, Nr. 1, date:9.1995: 77-104
|
|
|
|
246 |
Speeding up two string-matching algorithms
Enthalten in Algorithmica Bd. 12, Nr. 4-5, date:11.1994: 247-267
|
|
|
|
247 |
An investigation of phase-distribution moment-matching algorithms for use in queueing models
Enthalten in Queueing systems Bd. 8, Nr. 1, date:12.1991: 129-147
|
|
|
|
248 |
On the existence of fair matching algorithms
Enthalten in Theory and decision Bd. 26, Nr. 3, date:5.1989: 305-322
|
|
|
|
249 |
Tight bounds for minimax grid matching with applications to the average case analysis of algorithms
Enthalten in Combinatorica Bd. 9, Nr. 2, date:6.1989: 161-187
|
|
|
250 |
Programming in Networks and Graphs
Derigs, Ulrich. - New York, NY : Springer New York, 1988
|
|
Administration
