SCEAS

The SCEAS System

Title:
Author:

U. K. Sarkar: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

U. K. Sarkar, P. P. Chakrabarti, Sujoy Ghose, S. C. De Sarkar
Pruning by Upperbounds in Heuristic Search: Use of Approximate Algorithms. [Citation Graph (0, 0)][DBLP]
KBCS, 1989, pp:451-461 [Conf]
U. K. Sarkar, P. P. Chakrabarti, Sujoy Ghose, S. C. De Sarkar
Reducing Reexpansions in Iterative-Deepening Search by Controlling Cutoff Bounds. [Citation Graph (0, 0)][DBLP]
Artif. Intell., 1991, v:50, n:2, pp:207-221 [Journal]
U. K. Sarkar, P. P. Chakrabarti, Sujoy Ghose, S. C. De Sarkar
Multiple Stack Branch and Bound. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 1991, v:37, n:1, pp:43-48 [Journal]
U. K. Sarkar, P. P. Chakrabarti, Sujoy Ghose, S. C. De Sarkar
Effective Use of Memory in Iterative Deepening Search. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 1992, v:42, n:1, pp:47-52 [Journal]
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. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 1992, v:42, n:3, pp:173-177 [Journal]
U. K. Sarkar, P. P. Chakrabarti, Sujoy Ghose, S. C. De Sarkar
Improving Greedy Algorithms by Lookahead-Search. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1994, v:16, n:1, pp:1-23 [Journal]
U. K. Sarkar
On the design of a constructive algorithm to solve the multi-peg towers of Hanoi problem. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2000, v:237, n:1-2, pp:407-421 [Journal]

Search in 0.002secs, Finished in 0.003secs

NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades

NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP