Heuristic search in restricted memory. Zbl 0687.68040
Chakrabarti, P. P.; Ghose, S.; Acharya, A.; de Sarkar, S. C. |
|
1989
|
Reducing reexpansions in iterative-deepening search by controlling cutoff bounds. Zbl 0764.68157
Sarkar, U. K.; Chakrabarti, P. P.; Ghose, S.; De Sarkar, S. C. |
|
1991
|
Admissibility of \(AO^ *\) when heuristics overestimate. Zbl 0643.68153
Chakrabarti, P. P.; Ghose, S.; DeSarkar, S. C. |
|
1988
|
Agent searching in a tree and the optimality of iterative deepening. Zbl 0824.68098
Dasgupta, Pallab; Chakrabarti, P. P.; DeSarkar, S. C. |
|
1994
|
Improving greedy algorithms by lookahead-search. Zbl 0803.68124
Sarkar, U. K.; Chakrabarti, P. P.; Ghose, S.; DeSarkar, S. C. |
|
1994
|
Heuristic search through islands. Zbl 0624.68080
Chakrabarti, P. P.; Ghose, S.; DeSarkar, S. C. |
|
1986
|
Multiobjective heuristic search in AND/OR graphs. Zbl 0852.68016
Dasgupta, Pallab; Chakrabarti, P. P.; DeSarkar, S. C. |
|
1996
|
Multiobjective heuristic search. An introduction to intelligent search methods for multicriteria optimization. Zbl 0948.68051
Dasgupta, Pallab; Chakrabarti, P. P.; DeSarkar, S. C. |
|
1999
|
Simplification of incompletely specified flow tables with the help of prime closed sets. Zbl 0183.45602
de Sarkar, S. C.; Basu, A. K.; Choudhury, A. K. |
|
1969
|
Searching game trees under a partial order. Zbl 1506.68123
Dasgupta, Pallab; Chakrabarti, P. P.; DeSarkar, S. C. |
|
1996
|
Multiple stack branch and bound. Zbl 0711.68050
Sarkar, U. K.; Chakrabarti, P. P.; Ghose, S.; De Sarkar, S. C. |
|
1991
|
Effective use of memory in iterative deepening search. Zbl 0772.68086
Sarkar, U. K.; Chakrabarti, P. P.; Ghose, S.; De Sarkar, S. C. |
|
1992
|
A correction to: “Agent searching in a tree and the optimality of iterative deepening”. Zbl 1012.68532
Dasgupta, Pallab; Chakrabarti, P. P.; De Sarkar, S. C. |
|
1995
|
Utility of pathmax in partial order heuristic search. Zbl 0875.68770
Dasgupta, Pallab; Chakrabarti, P. P.; DeSarkar, S. C. |
|
1995
|
Increasing search efficiency using multiple heuristics. Zbl 0669.68056
Chakrabarti, P. P.; Ghose, S.; Pandey, A.; de Sarkar, S. C. |
|
1989
|
A simple 0.5-bounded greedy algorithm for the 0/1 knapsack problem. Zbl 0780.68045
Sarkar, U. K.; Chakrabarti, P. P.; Ghose, S.; De Sarkar, S. C. |
|
1992
|
Generalized best first search using single and multiple heuristics. Zbl 0764.68025
Chakrabarti, P. P.; Ghose, S.; de Sarkar, S. C. |
|
1992
|
A near optimal algorithm for the extended cow-path problem in the presence of relative errors. Zbl 1354.68238
Dasgupta, Pallas; Chakrabarti, P. P.; DeSarkar, S. C. |
|
1995
|
Multiobjective heuristic search. An introduction to intelligent search methods for multicriteria optimization. Zbl 0948.68051
Dasgupta, Pallab; Chakrabarti, P. P.; DeSarkar, S. C. |
|
1999
|
Multiobjective heuristic search in AND/OR graphs. Zbl 0852.68016
Dasgupta, Pallab; Chakrabarti, P. P.; DeSarkar, S. C. |
|
1996
|
Searching game trees under a partial order. Zbl 1506.68123
Dasgupta, Pallab; Chakrabarti, P. P.; DeSarkar, S. C. |
|
1996
|
A correction to: “Agent searching in a tree and the optimality of iterative deepening”. Zbl 1012.68532
Dasgupta, Pallab; Chakrabarti, P. P.; De Sarkar, S. C. |
|
1995
|
Utility of pathmax in partial order heuristic search. Zbl 0875.68770
Dasgupta, Pallab; Chakrabarti, P. P.; DeSarkar, S. C. |
|
1995
|
A near optimal algorithm for the extended cow-path problem in the presence of relative errors. Zbl 1354.68238
Dasgupta, Pallas; Chakrabarti, P. P.; DeSarkar, S. C. |
|
1995
|
Agent searching in a tree and the optimality of iterative deepening. Zbl 0824.68098
Dasgupta, Pallab; Chakrabarti, P. P.; DeSarkar, S. C. |
|
1994
|
Improving greedy algorithms by lookahead-search. Zbl 0803.68124
Sarkar, U. K.; Chakrabarti, P. P.; Ghose, S.; DeSarkar, S. C. |
|
1994
|
Effective use of memory in iterative deepening search. Zbl 0772.68086
Sarkar, 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. Zbl 0780.68045
Sarkar, U. K.; Chakrabarti, P. P.; Ghose, S.; De Sarkar, S. C. |
|
1992
|
Generalized best first search using single and multiple heuristics. Zbl 0764.68025
Chakrabarti, P. P.; Ghose, S.; de Sarkar, S. C. |
|
1992
|
Reducing reexpansions in iterative-deepening search by controlling cutoff bounds. Zbl 0764.68157
Sarkar, U. K.; Chakrabarti, P. P.; Ghose, S.; De Sarkar, S. C. |
|
1991
|
Multiple stack branch and bound. Zbl 0711.68050
Sarkar, U. K.; Chakrabarti, P. P.; Ghose, S.; De Sarkar, S. C. |
|
1991
|
Heuristic search in restricted memory. Zbl 0687.68040
Chakrabarti, P. P.; Ghose, S.; Acharya, A.; de Sarkar, S. C. |
|
1989
|
Increasing search efficiency using multiple heuristics. Zbl 0669.68056
Chakrabarti, P. P.; Ghose, S.; Pandey, A.; de Sarkar, S. C. |
|
1989
|
Admissibility of \(AO^ *\) when heuristics overestimate. Zbl 0643.68153
Chakrabarti, P. P.; Ghose, S.; DeSarkar, S. C. |
|
1988
|
Heuristic search through islands. Zbl 0624.68080
Chakrabarti, P. P.; Ghose, S.; DeSarkar, S. C. |
|
1986
|
Simplification of incompletely specified flow tables with the help of prime closed sets. Zbl 0183.45602
de Sarkar, S. C.; Basu, A. K.; Choudhury, A. K. |
|
1969
|