Searching game trees under a partial order von Dasgupta, Pallab, Chakrabarti, P.P., DeSarkar, S.C.

Volltext

A correction to “Agent searching in a tree and the optimality of iterative deepening” von Dasgupta, Pallab, Chakrabarti, P.P., DeSarkar, S.C.

Volltext

Agent searching in a tree and the optimality of iterative deepening von Dasgupta, Pallab, Chakrabarti, P.P., DeSarkar, S.C.

Volltext

Utility of pathmax in partial order heuristic search von Dasgupta, Pallab, Chakrabarti, P.P, DeSarkar, S.C

Volltext

Agent search in uniform b-ary trees: Multiple goals and unequal costs von Dasgupta, Pallab, Chakrabarti, P.P., DeSarkar, S.C.

Volltext

Multiobjective Heuristic Search in AND/OR Graphs von Dasgupta, Pallab, Chakrabarti, P.P., DeSarkar, S.C.

Volltext

Improving Greedy Algorithms by Lookahead-Search von Sarkar, U.K., Chakrabarti, P.P., Ghose, S., Desarkar, S.C.

Volltext

Heuristic search through islands von Chakrabarti, P.P., Ghose, S., DeSarkar, S.C.

Volltext

Admissibility of AO∗ when heuristics overestimate von Chakrabarti, P.P., Ghose, S., DeSarkar, S.C.

Volltext

Multiobjective search in VLSI design von Dasgupta, P., Mitra, P., Chakrabarti, P.P., DeSarkar, S.C.

Volltext

Authors' Reply von Choudhury, A.K., Basu, A.K., DeSarkar, S.C.

Volltext

Authors' reply von Choudhury, A.K., Basu, A.K., DeSarkar, S.C.

Volltext

Heuristic search in restricted memory von Chakrabarti, P.P., Ghose, S., Acharya, A., de Sarkar, S.C.

Volltext

Reducing reexpansions in iterative-deepening search by controlling cutoff bounds von Sarkar, U.K., Chakrabarti, P.P., Ghose, S., De Sarkar, S.C.

Volltext

A theorem prover for verifying iterative programs over integers von Sarkar, D., De Sarkar, S.C.

Volltext

Some inference rules for integer arithmetic for verification of flowchart programs on integers von Sarkar, D.C., De Sarkar, S.C.

Volltext

Generalized best first search using single and multiple heuristics von Chakrabarti, P.P., Ghose, S., De Sarkar, S.C.

Volltext

A set of inference rules for quantified formula handling and array handling in verification of programs over integers von Sarkar, D., De Sarkar, S.C.

Volltext

A simple 0.5-bounded greedy algorithm for the 0/1 knapsack problem von Sarkar, U.K., Chakrabarti, P.P., Ghose, S., De Sarkar, S.C.

Volltext

Effective use of memory in iterative deepening search von Sarkar, U.K., Chakrabarti, P.P., Ghose, S., De Sarkar, S.C.

Volltext