The following pages link to U. K. Sarkar (Q922702):
Displayed 8 items.
- Multiple stack branch and bound (Q922704) (← links)
- Reducing reexpansions in iterative-deepening search by controlling cutoff bounds (Q1187216) (← links)
- Effective use of memory in iterative deepening search (Q1198022) (← links)
- A simple 0.5-bounded greedy algorithm for the 0/1 knapsack problem (Q1198054) (← links)
- On the design of a constructive algorithm to solve the multi-peg towers of Hanoi problem (Q1566738) (← links)
- On uniqueness of solution to the multi-peg towers of hanoi (Q2752267) (← links)
- (Q3566042) (← links)
- Improving Greedy Algorithms by Lookahead-Search (Q4289838) (← links)