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

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

A theorem prover for verifying iterative programs over integers von Sarkar, D., 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 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

Multiple stack branch and bound von Sarkar, U.K., Chakrabarti, P.P., Ghose, S., De Sarkar, S.C.

Volltext

Increasing search efficiency using multiple heuristics von Chakrabarti, P.P., Ghose, S., Pandey, A., De Sarkar, S.C.

Volltext

Simplification of Incompletely Specified Flow Tables with the Help of Prime Closed Sets von De Sarkar, S.C., Basu, A.K., Choudhury, A.K.

Volltext