✦ LIBER ✦

On the complexity of IQML algorithms

✍ Scribed by Clark, M.P.; Scharf, L.L.

Book ID: 119789332
Publisher: IEEE
Year: 1992
Tongue: English
Weight: 291 KB
Volume: 40
Category: Article
ISSN: 1053-587X
DOI: 10.1109/78.143451

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On frequency estimation with the IQML al

On frequency estimation with the IQML algorithm

✍ Nagesha, V.; Kay, S. 📂 Article 📅 1994 🏛 IEEE 🌐 English ⚖ 464 KB

Improving threshold performance of the I

Improving threshold performance of the IQML algorithm

✍ Read, W.J.L. 📂 Article 📅 2000 🏛 IEEE 🌐 English ⚖ 133 KB

The most efficient implementation of the

The most efficient implementation of the IQML algorithm

✍ Yingbo Hua 📂 Article 📅 1994 🏛 IEEE 🌐 English ⚖ 200 KB

On the complexity of search algorithms

✍ Kuo-Liang Chung; Wen-Chin Chen; Ferng-Ching Lin 📂 Article 📅 1992 🏛 IEEE 🌐 English ⚖ 435 KB

On the space complexity of recursive alg

On the space complexity of recursive algorithms

✍ Eitan M. Gurari; Oscar H. Ibarra 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 769 KB

On the complexity of admissible search a

On the complexity of admissible search algorithms

✍ Alberto Martelli 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 788 KB

This paper analyzes the complexity of heuristic search algorithms, Le. algorithms which find the shortest path in a graph by using an estimate to guide the search. In particular, .algorithm A\*, due to Hart, Nilsson and Raphael, is shown to require 0(2 ~) steps, in the worst cdse, for searching a gr