Search the dblp DataBase

Publications of Author

1. Subir Bhattacharya, Amitava Bagchi
   Making Best Use of Available Memory When Searching Game Trees. [Citation Graph (0, 0)][DBLP]
   AAAI, 1986, pp:163-167 [Conf]
   
2. Subir Bhattacharya, Amitava Bagchi
   Searching Game Trees Under Memory Constraints. [Citation Graph (0, 0)][DBLP]
   AAAI/IAAI, Vol. 1, 1996, pp:222-227 [Conf]
   
3. Subir Bhattacharya
   Experimenting with Revisits in Game Tree Search. [Citation Graph (0, 0)][DBLP]
   IJCAI, 1995, pp:243-251 [Conf]
   
4. Subir Bhattacharya, Amitava Bagchi
   Searching Game Trees in Parallel Using SSS. [Citation Graph (0, 0)][DBLP]
   IJCAI, 1989, pp:42-47 [Conf]
   
5. Subir Bhattacharya, Amitava Bagchi
   QuickGame: A Compromise Between Pure Depth-first and Pure Best-first Game Tree Search Strategies. [Citation Graph (0, 0)][DBLP]
   IWAR, 1992, pp:211-220 [Conf]
   
6. Subir Bhattacharya, Amitava Bagchi
   A Faster Alternative to SSS* with Extension to Variable Memory. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1993, v:47, n:4, pp:209-214 [Journal]
   
7. Subir Bhattacharya, Amitava Bagchi
   A General Framework for Minimax Search in Game Trees. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1994, v:52, n:6, pp:295-301 [Journal]
   
8. Subir Bhattacharya, Sumit Kumar Bose
   Mathematical model for scheduling operations in cascaded continuous processing units. [Citation Graph (0, 0)][DBLP]
   European Journal of Operational Research, 2007, v:182, n:1, pp:1-14 [Journal]
   
9. 
   Agent Based Model for Cardinality Constrained Portfolio Selection Problem: Preliminary Results. [Citation Graph (, )][DBLP]
   
   
10. 
    Impact of Requirements Discovery Pattern on Software Project Outcome: Preliminary Results. [Citation Graph (, )][DBLP]