𝔖 Bobbio Scriptorium

✦ LIBER ✦

Asymptotics of Divide-and-Conquer Recurrences: Batcher's Sorting Algorithm and a Minimum Euclidean Matching Heuristic

✍ Scribed by H. -K. Hwang

Book ID: 105746491
Publisher: Springer
Year: 1998
Tongue: English
Weight: 300 KB
Volume: 22
Category: Article
ISSN: 0178-4617
DOI: 10.1007/pl00009238

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Probabilistic analysis of divide-and-con

Probabilistic analysis of divide-and-conquer heuristics for minimum weighted euclidean matching

✍ Edward M. Reingold; Kenneth J. Supowit 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 592 KB

[American Institute of Aeronautics and A

[American Institute of Aeronautics and Astronautics 5th Symposium on Multidisciplinary Analysis and Optimization - Panama City Beach,FL,U.S.A. (07 September 1994 - 09 September 1994)] 5th Symposium on Multidisciplinary Analysis and Optimization - Solving a trajectory minimum time problem by asymptotic matching - Application to optimal aerospace design using a genetic algorithm

✍ Sero-Guillaume, O.; Felici, T.; Bernardin, D.; Antonicelli, M. 📂 Article 📅 1994 🏛 American Institute of Aeronautics and Astronautics ⚖ 553 KB