S. C. de Sarkar

Available identifiers

Publication	Date of Publication	Type
A new competitive algorithm for agent searching in unknown streets	2024-07-05	Paper
Searching game trees under a partial order	2022-09-22	Paper
A near optimal algorithm for the extended cow-path problem in the presence of relative errors	2017-01-19	Paper
A correction to: ``Agent searching in a tree and the optimality of iterative deepening	2003-02-04	Paper
Heuristic search strategies for multiobjective state space search	2002-02-18	Paper
https://portal.mardi4nfdi.de/entity/Q4933704	2000-01-11	Paper
Agent search in uniform b-ary trees: Multiple goals and unequal costs	1997-02-27	Paper
Utility of pathmax in partial order heuristic search	1997-02-27	Paper
Multiobjective Heuristic Search in AND/OR Graphs	1996-12-11	Paper
Agent searching in a tree and the optimality of iterative deepening	1995-01-09	Paper
Improving Greedy Algorithms by Lookahead-Search	1994-04-28	Paper
Effective use of memory in iterative deepening search	1993-01-16	Paper
A simple 0.5-bounded greedy algorithm for the 0/1 knapsack problem	1993-01-16	Paper
Generalized best first search using single and multiple heuristics	1992-06-28	Paper
Reducing reexpansions in iterative-deepening search by controlling cutoff bounds	1992-06-28	Paper
Multiple stack branch and bound	1991-01-01	Paper
Admissibility of \(AO^ *\) when heuristics overestimate	1988-01-01	Paper
Heuristic search through islands	1986-01-01	Paper

This page was built for person: S. C. de Sarkar