The following pages link to Amitava Bagchi (Q814591):
Displaying 13 items.
- (Q689626) (redirect page) (← links)
- A faster alternative to \(SSS^*\) with extension to variable memory (Q689627) (← links)
- Average-case analysis of best-first search in two representative directed acyclic graphs (Q814592) (← links)
- Aspects of insertion in random trees (Q1160488) (← links)
- A general framework for minimax search in game trees (Q1342257) (← links)
- The multiple resource constrained project scheduling problem: A breadth-first approach (Q1806916) (← links)
- On estimating the time taken to rectify faults in a software package during the system testing phase (Q2380017) (← links)
- Constraint satisfaction methods for solving the staff transfer problem (Q2476428) (← links)
- A Naturally Occurring Function Continuous Only at Irrationals (Q3329675) (← links)
- (Q3489496) (← links)
- (Q4012186) (← links)
- Distributed Computing - IWDC 2003 (Q5191422) (← links)
- Distributed Computing - IWDC 2003 (Q5191459) (← links)