 | 2009 |
|---|
| 11 |       | Ritesh Kumar,
Subir Bhattacharya:
Agent Based Model for Cardinality Constrained Portfolio Selection Problem: Preliminary Results.
HICSS 2009: 1-10 |
| 10 | | Rahul Thakurta,
Rahul Roy,
Subir Bhattacharya:
Impact of Requirements Discovery Pattern on Software Project Outcome: Preliminary Results.
HICSS 2009: 1-6 |
| 2008 |
|---|
| 9 | | Sumit Kumar Bose,
Subir Bhattacharya:
A two pass heuristic algorithm for scheduling 'blocked out' units in continuous process industry.
Annals OR 159(1): 293-313 (2008) |
| 2007 |
|---|
| 8 | | Subir Bhattacharya,
Sumit Kumar Bose:
Mathematical model for scheduling operations in cascaded continuous processing units.
European Journal of Operational Research 182(1): 1-14 (2007) |
| 1996 |
|---|
| 7 |  | Subir Bhattacharya,
Amitava Bagchi:
Searching Game Trees Under Memory Constraints.
AAAI/IAAI, Vol. 1 1996: 222-227 |
| 1995 |
|---|
| 6 | | Subir Bhattacharya:
Experimenting with Revisits in Game Tree Search.
IJCAI 1995: 243-251 |
| 1994 |
|---|
| 5 | | Subir Bhattacharya,
Amitava Bagchi:
A General Framework for Minimax Search in Game Trees.
Inf. Process. Lett. 52(6): 295-301 (1994) |
| 1993 |
|---|
| 4 | | Subir Bhattacharya,
Amitava Bagchi:
A Faster Alternative to SSS* with Extension to Variable Memory.
Inf. Process. Lett. 47(4): 209-214 (1993) |
| 1992 |
|---|
| 3 | | Subir Bhattacharya,
Amitava Bagchi:
QuickGame: A Compromise Between Pure Depth-first and Pure Best-first Game Tree Search Strategies.
IWAR 1992: 211-220 |
| 1989 |
|---|
| 2 | | Subir Bhattacharya,
Amitava Bagchi:
Searching Game Trees in Parallel Using SSS.
IJCAI 1989: 42-47 |
| 1986 |
|---|
| 1 | | Subir Bhattacharya,
Amitava Bagchi:
Making Best Use of Available Memory When Searching Game Trees.
AAAI 1986: 163-167 |
