Sarkar, U. K. ; Chakrabarti, P. P. ; Ghose, S. ; De Sarkar, S. C. (1992) Effective use of memory in iterative deepening search Information Processing Letters, 42 (1). pp. 47-52. ISSN 0020-0190
Full text not available from this repository.
Official URL: http://linkinghub.elsevier.com/retrieve/pii/002001...
Related URL: http://dx.doi.org/10.1016/0020-0190(92)90131-E
Abstract
The Iterative Deepening A* (IDA*) (R.E. Korf, Artificial Intelligence 27 (1985)) algorithm often reexpands too many nodes while solving certain combinatorial problems. Algorithm IDA*_CR (U.K. Sarkar, Artificial Intelligence 50 (1991)) attempted to remedy this drawback. These algorithms require very little memory although much more is available in practice. This paper introduces an algorithm IDA_CRM which shows how the available memory can be advantageously utilized in IDAast;_CR in order to reduce the number of expanded nodes. IDA*_CRAM, an approximation scheme derived from IDA_CRM, is also presented. Computational results are shown for the Flow-Shop Scheduling Problem.
| Item Type: | Article |
|---|---|
| Source: | Copyright of this article belongs to Elsevier Science. |
| Keywords: | Artificial Intelligence; Design of Algorithms; Combinatorial Problems; Tree Search; A*; IDA*; Approximation Algorithm; Flow-shop Scheduling |
| ID Code: | 5944 |
| Deposited On: | 19 Oct 2010 10:07 |
| Last Modified: | 20 May 2011 09:50 |
Repository Staff Only: item control page
