| 2000 |
|---|
| 7 | EE | U. K. Sarkar:
On the design of a constructive algorithm to solve the multi-peg towers of Hanoi problem.
Theor. Comput. Sci. 237(1-2): 407-421 (2000) |
| 1994 |
|---|
| 6 | | U. K. Sarkar,
P. P. Chakrabarti,
Sujoy Ghose,
S. C. De Sarkar:
Improving Greedy Algorithms by Lookahead-Search.
J. Algorithms 16(1): 1-23 (1994) |
| 1992 |
|---|
| 5 | | U. K. Sarkar,
P. P. Chakrabarti,
Sujoy Ghose,
S. C. De Sarkar:
Effective Use of Memory in Iterative Deepening Search.
Inf. Process. Lett. 42(1): 47-52 (1992) |
| 4 | | U. K. Sarkar,
P. P. Chakrabarti,
Sujoy Ghose,
S. C. De Sarkar:
A Simple 0.5-Bounded Greedy Algorithm for the 0/1 Knapsack Problem.
Inf. Process. Lett. 42(3): 173-177 (1992) |
| 1991 |
|---|
| 3 | | U. K. Sarkar,
P. P. Chakrabarti,
Sujoy Ghose,
S. C. De Sarkar:
Reducing Reexpansions in Iterative-Deepening Search by Controlling Cutoff Bounds.
Artif. Intell. 50(2): 207-221 (1991) |
| 2 | | U. K. Sarkar,
P. P. Chakrabarti,
Sujoy Ghose,
S. C. De Sarkar:
Multiple Stack Branch and Bound.
Inf. Process. Lett. 37(1): 43-48 (1991) |
| 1989 |
|---|
| 1 | | U. K. Sarkar,
P. P. Chakrabarti,
Sujoy Ghose,
S. C. De Sarkar:
Pruning by Upperbounds in Heuristic Search: Use of Approximate Algorithms.
KBCS 1989: 451-461 |
