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. Anup K. Sen, Amitava Bagchi, Weixiong Zhang
   An Average-Case Analysis of Graph Search. [Citation Graph (0, 0)][DBLP]
   AAAI/IAAI, 2002, pp:757-0 [Conf]
   
4. Amitava Bagchi, Anup K. Sen
   Heuristic search in general tree structures: an average case analysis. [Citation Graph (0, 0)][DBLP]
   ACM Conference on Computer Science, 1986, pp:309-318 [Conf]
   
5. Rahul Roy, Amitava Bagchi
   The Development, Testing, and Release of Software Systems in the Internet Age: A Generalized Analytical Model. [Citation Graph (0, 0)][DBLP]
   ICIS, 2004, pp:399-412 [Conf]
   
6. Subir Bhattacharya, Amitava Bagchi
   Searching Game Trees in Parallel Using SSS. [Citation Graph (0, 0)][DBLP]
   IJCAI, 1989, pp:42-47 [Conf]
   
7. Anup K. Sen, Amitava Bagchi
   Fast Recursive Formulations for Best-First Search That Allow Controlled Use of Memory. [Citation Graph (0, 0)][DBLP]
   IJCAI, 1989, pp:297-302 [Conf]
   
8. Anup K. Sen, Amitava Bagchi
   Non-Order-Preserving Evaluation Functions: Recursive Graph-Search Methods for Job Sequencing Problems. [Citation Graph (0, 0)][DBLP]
   IJCAI, 1993, pp:1423-1429 [Conf]
   
9. Anup K. Sen, Amitava Bagchi, Bani K. Sinha
   Admissible Search Methods for Minimum Penalty Sequencing of Jobs with Setup Times on One and Two Machines. [Citation Graph (0, 0)][DBLP]
   IJCAI, 1991, pp:178-183 [Conf]
   
10. 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]
    
11. Amitava Bagchi, Atul Saroop
    Internet Auctions: Some Issues and Problems. [Citation Graph (0, 0)][DBLP]
    IWDC, 2003, pp:112-119 [Conf]
    
12. Wei T. Yue, Amitava Bagchi
    Tuning the Quality Parameters of a Firewall to Maximize Net Benefit. [Citation Graph (0, 0)][DBLP]
    IWDC, 2003, pp:321-329 [Conf]
    
13. Anup K. Sen, Amitava Bagchi
    Graph Search Methods for Non-Order-Preserving Evaluation Functions: Applications to Job Sequencing Problems. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1996, v:86, n:1, pp:43-73 [Journal]
    
14. Anup K. Sen, Amitava Bagchi, Weixiong Zhang
    Average-case analysis of best-first search in two representative directed acyclic graphs. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2004, v:155, n:1-2, pp:183-206 [Journal]
    
15. 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]
    
16. 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]
    
17. Rahul Roy, Amitava Bagchi
    On estimating the time taken to rectify faults in a software package during the system testing phase. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:104, n:5, pp:168-172 [Journal]
    
18. 
    Bidder Valuation of Bundles in Combinatorial Auctions. [Citation Graph (, )][DBLP]
    
    
19. 
    Revaluation of Bundles by Bidders in Combinatorial Auctions. [Citation Graph (, )][DBLP]
    
    
20. 
    Designing Proxy Bidders for Online Combinatorial Auctions. [Citation Graph (, )][DBLP]