Items where Author is "De Sarkar, S. C."Group by: Item Type | No Grouping Jump to: Article Number of items: 5. ArticleSarkar, U. K. ; Chakrabarti, P. P. ; Ghose, S. ; De Sarkar, S. C. (1992) A simple 0.5-bounded greedy algorithm for the 0/1 knapsack problem Information Processing Letters, 42 (3). pp. 173-177. ISSN 0020-0190 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 Sarkar, U. K. ; Chakrabarti, P. P. ; Ghose, S. ; De Sarkar, S. C. (1991) Reducing reexpansions in iterative-deepening search by controlling cutoff bounds Artificial Intelligence, 50 (2). pp. 207-221. ISSN 0004-3702 Sarkar, U. K. ; Chakrabarti, P. P. ; Ghose, S. ; De Sarkar, S. C. (1991) Multiple stack branch and bound Information Processing Letters, 37 (1). pp. 43-48. ISSN 0020-0190 Chakrabarti, P. P. ; Ghose, S. ; Acharya, A. ; De Sarkar, S. C. (1989) Heuristic search in restricted memory Artificial Intelligence, 41 (2). pp. 197-221. ISSN 0004-3702 |

Up a level