✦ LIBER ✦

An improved merging algorithm using a minimum number of comparisons

✍ Scribed by E. P. Zabello

Publisher: Springer US
Year: 1990
Tongue: English
Weight: 608 KB
Volume: 26
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01082686

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimum number of tardy jobs in single m

Minimum number of tardy jobs in single machine scheduling with release dates—an improved algorithm

✍ Thuruthickara C. John; Yih-Bor Wu 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 352 KB

An algorithm for the minimum number of t

An algorithm for the minimum number of transport units to maintain a fixed schedule

✍ T. E. Bartlett 📂 Article 📅 1957 🏛 John Wiley and Sons 🌐 English ⚖ 491 KB

A method of solving scheduling problems

A method of solving scheduling problems using an improved guided genetic algorithm

✍ Gyouhi Ou; Hiroki Tamura; Koichi Tanno; Zheng Tang 📂 Article 📅 2010 🏛 Wiley (John Wiley & Sons) 🌐 English ⚖ 951 KB

An algorithm for construction of a k-con

An algorithm for construction of a k-connected graph with minimum number of edges and quasiminimal diameter

✍ Ulrich Schumacher 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 470 KB

Two fundamental considerations in the design of a communication network are reliability and maximum transmission delay. In this paper we give an algorithm for construction of an undirected graph with n vertices in which there are k node-disjoint paths between any two nodes. The generated graphs will

An improvement of fixed point algorithms

An improvement of fixed point algorithms by using a good triangulation

✍ G. van der Laan; A. J. J. Talman 📂 Article 📅 1980 🏛 Springer-Verlag 🌐 English ⚖ 542 KB

Material selection using an improved Gen

Material selection using an improved Genetic Algorithm for material design of components made of a multiphase material

✍ Xiu-Juan Zhang; Ke-Zhang Chen; Xin-An Feng 📂 Article 📅 2008 🏛 Elsevier Science ⚖ 190 KB