✦ LIBER ✦

Temporal resolution using a breadth-first search algorithm

✍ Scribed by Clare Dixon

Book ID: 110379860
Publisher: Springer Netherlands
Year: 1998
Tongue: English
Weight: 258 KB
Volume: 22
Category: Article
ISSN: 1012-2443
DOI: 10.1023/a:1018942108420

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A new distributed breadth-first-search a

A new distributed breadth-first-search algorithm

✍ Yunzhou Zhu; To-Yat Cheung 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 367 KB

Shortest path algorithms using dynamic b

Shortest path algorithms using dynamic breadth-first search

✍ Donald Goldfarb; Jianxiu Hao; Sheng-Roan Kai 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 1022 KB

A new O(nm) label-correcting algorithm is presented for finding shortest paths from a given node to all other nodes in a network of n nodes and m arcs or finding a directed cycle of negative length. In this algorithm, a node is scanned on the k-th scanning step only if its "label depth"-i.e., the le

Ring Perception Using Breadth-First Sear

Ring Perception Using Breadth-First Search

✍ Figueras, J. 📂 Article 📅 1996 🏛 American Chemical Society 🌐 English ⚖ 170 KB

Breadth-first heuristic search

✍ Rong Zhou; Eric A. Hansen 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 202 KB

Salembier's Min-tree algorithm turned in

Salembier's Min-tree algorithm turned into breadth first search

✍ Wim H. Hesselink 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 153 KB

Soft-decision decoding of binary linear

Soft-decision decoding of binary linear block codes using reduced breadth-first search algorithms

✍ Kokkonen, M.; Kalliojarvi, K. 📂 Article 📅 2000 🏛 IEEE 🌐 English ⚖ 78 KB