| 2009 |
|---|
| 20 | EE | Soumyakanti Chakraborty,
Anup K. Sen,
Amitava Bagchi:
Designing Proxy Bidders for Online Combinatorial Auctions.
HICSS 2009: 1-10 |
| 19 | EE | Soumyakanti Chakraborty,
Anup K. Sen,
Amitava Bagchi:
Revaluation of Bundles by Bidders in Combinatorial Auctions.
HICSS 2009: 1-10 |
| 2008 |
|---|
| 18 | EE | Soumyakanti Chakraborty,
Anup K. Sen,
Amitava Bagchi:
Bidder Valuation of Bundles in Combinatorial Auctions.
HICSS 2008: 51 |
| 2007 |
|---|
| 17 | EE | Rahul Roy,
Amitava Bagchi:
On estimating the time taken to rectify faults in a software package during the system testing phase.
Inf. Process. Lett. 104(5): 168-172 (2007) |
| 2004 |
|---|
| 16 | | Rahul Roy,
Amitava Bagchi:
The Development, Testing, and Release of Software Systems in the Internet Age: A Generalized Analytical Model.
ICIS 2004: 399-412 |
| 15 | EE | Anup K. Sen,
Amitava Bagchi,
Weixiong Zhang:
Average-case analysis of best-first search in two representative directed acyclic graphs.
Artif. Intell. 155(1-2): 183-206 (2004) |
| 2003 |
|---|
| 14 | EE | Amitava Bagchi,
Atul Saroop:
Internet Auctions: Some Issues and Problems.
IWDC 2003: 112-119 |
| 13 | EE | Wei T. Yue,
Amitava Bagchi:
Tuning the Quality Parameters of a Firewall to Maximize Net Benefit.
IWDC 2003: 321-329 |
| 2002 |
|---|
| 12 | | Anup K. Sen,
Amitava Bagchi,
Weixiong Zhang:
An Average-Case Analysis of Graph Search.
AAAI/IAAI 2002: 757- |
| 1996 |
|---|
| 11 | | Subir Bhattacharya,
Amitava Bagchi:
Searching Game Trees Under Memory Constraints.
AAAI/IAAI, Vol. 1 1996: 222-227 |
| 10 | EE | Anup K. Sen,
Amitava Bagchi:
Graph Search Methods for Non-Order-Preserving Evaluation Functions: Applications to Job Sequencing Problems.
Artif. Intell. 86(1): 43-73 (1996) |
| 1994 |
|---|
| 9 | | Subir Bhattacharya,
Amitava Bagchi:
A General Framework for Minimax Search in Game Trees.
Inf. Process. Lett. 52(6): 295-301 (1994) |
| 1993 |
|---|
| 8 | | Anup K. Sen,
Amitava Bagchi:
Non-Order-Preserving Evaluation Functions: Recursive Graph-Search Methods for Job Sequencing Problems.
IJCAI 1993: 1423-1429 |
| 7 | | Subir Bhattacharya,
Amitava Bagchi:
A Faster Alternative to SSS* with Extension to Variable Memory.
Inf. Process. Lett. 47(4): 209-214 (1993) |
| 1992 |
|---|
| 6 | | Subir Bhattacharya,
Amitava Bagchi:
QuickGame: A Compromise Between Pure Depth-first and Pure Best-first Game Tree Search Strategies.
IWAR 1992: 211-220 |
| 1991 |
|---|
| 5 | | 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.
IJCAI 1991: 178-183 |
| 1989 |
|---|
| 4 | | Anup K. Sen,
Amitava Bagchi:
Fast Recursive Formulations for Best-First Search That Allow Controlled Use of Memory.
IJCAI 1989: 297-302 |
| 3 | | Subir Bhattacharya,
Amitava Bagchi:
Searching Game Trees in Parallel Using SSS.
IJCAI 1989: 42-47 |
| 1986 |
|---|
| 2 | | Subir Bhattacharya,
Amitava Bagchi:
Making Best Use of Available Memory When Searching Game Trees.
AAAI 1986: 163-167 |
| 1 | EE | Amitava Bagchi,
Anup K. Sen:
Heuristic search in general tree structures: an average case analysis.
ACM Conference on Computer Science 1986: 309-318 |
