✦ LIBER ✦

A new algorithm for heuristic search which uses hints

✍ Scribed by Łudovít Molnár; Pavol Návrat; Vladimír Vojtek

Publisher: Elsevier Science
Year: 1985
Weight: 306 KB
Volume: 12
Category: Article
ISSN: 0066-4138
DOI: 10.1016/0066-4138(85)90022-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Index fund optimization using a genetic

Index fund optimization using a genetic algorithm and a heuristic local search

✍ Yukiko Orito; Manabu Inoguchi; Hisashi Yamamoto 📂 Article 📅 2010 🏛 Wiley (John Wiley & Sons) 🌐 English ⚖ 931 KB

A face search heuristic algorithm for op

A face search heuristic algorithm for optimizing over the efficient set

✍ Harold P. Benson; Serpil Sayin 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 769 KB

A new algorithm and a new heuristic for

A new algorithm and a new heuristic for serial supply systems

✍ Guillermo Gallego; Özalp Özer 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 242 KB

A new algorithm for automatic photopeak

A new algorithm for automatic photopeak searches

✍ Z.K. Silagadze 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 301 KB

An efficient compression scheme for data

An efficient compression scheme for data communication which uses a new family of self-organizing binary search trees

✍ Luis Rueda; B. John Oommen 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 253 KB

Word-oriented approximate string matchin

Word-oriented approximate string matching using occurrence heuristic tables: A heuristic for searching Arabic text

✍ Suleiman H. Mustafa 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 143 KB 👁 2 views

## Abstract In this article, a word‐oriented approximate string matching approach for searching Arabic text is presented. The distance between a pair of words is determined on the basis of aligning the two words by using occurrence heuristic tables. Two words are considered related if they have the