๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the complexity of search algorithms

โœ Scribed by Kuo-Liang Chung; Wen-Chin Chen; Ferng-Ching Lin

Book ID
119771867
Publisher
IEEE
Year
1992
Tongue
English
Weight
435 KB
Volume
41
Category
Article
ISSN
0018-9340

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

[Lecture Notes in Computer Science] Comp
[Lecture Notes in Computer Science] Computational Intelligence and Security Volume 4456 || About the Time Complexity of Evolutionary Algorithms Based on Finite Search Space
โœ Wang, Yuping; Cheung, Yiu-ming; Liu, Hailin ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› Springer Berlin Heidelberg ๐ŸŒ German โš– 354 KB

The Refereed Post-proceedings Of The International Conference On Computational Intelligence And Security Are Presented In This Volume. The 116 Papers Were Submitted To Two Rounds Of Careful Review. Papers Cover Bio-inspired Computing, Evolutionary Computation, Learning Systems And Multi-agents, Cryp

On the complexity of IQML algorithms
On the complexity of IQML algorithms
โœ Clark, M.P.; Scharf, L.L. ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› IEEE ๐ŸŒ English โš– 291 KB