✦ LIBER ✦

A two-path tree search algorithm for use with DFE

✍ Scribed by Xiaodong Wang; Spencer, R.R.

Book ID: 114557978
Publisher: IEEE
Year: 2000
Tongue: English
Weight: 76 KB
Volume: 48
Category: Article
ISSN: 0090-6778
DOI: 10.1109/26.848547

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A heuristic search algorithm for path de

A heuristic search algorithm for path determination with learning

✍ Bander, J.L.; White, C.C., III 📂 Article 📅 1998 🏛 IEEE 🌐 English ⚖ 153 KB

Searching for an optimal path in a tree

Searching for an optimal path in a tree with random costs

✍ Richard M. Karp; Judea Pearl 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 690 KB

A two-phase shortest path algorithm for

A two-phase shortest path algorithm for networks with node coordinates

✍ Jens Lysgaard 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 389 KB

A memetic algorithm for job shop schedul

A memetic algorithm for job shop scheduling using a critical-path-based local search heuristic

✍ Mohammad R. Raeesi N., Ziad Kobti 📂 Article 📅 2012 🏛 Springer-Verlag 🌐 English ⚖ 740 KB

A new heuristic algorithm for finding mi

A new heuristic algorithm for finding minimum-cost multicast trees with bounded path delay

✍ Anna Hać; Kelei Zhou 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 246 KB

## This article presents a new heuristic algorithm called DDBMA (Dynamic Delay Bounded Multicast Algorithm) to construct a minimum-cost multicast tree. The heuristic depends on (1) bounded delay along paths from source nodes to each destination node; (2) minimum cost of the multicast tree; (3) dyn

A tabu search algorithm for the minmax r

A tabu search algorithm for the minmax regret minimum spanning tree problem with interval data

✍ Adam Kasperski, Mariusz Makuchowski, Paweł Zieliński 📂 Article 📅 2012 🏛 Springer US 🌐 English ⚖ 972 KB