Amitava Bagchi

According to our database, Amitava Bagchi authored at least 35 papers between 1983 and 2020.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2020

Designing information feedback for bidders in multi-item multi-unit combinatorial auctions.

Anup K. Sen, Amitava Bagchi, Soumyakanti Chakraborty

Decis. Support Syst., 2020

2015

Addressing the valuation problem in multi-round combinatorial auctions.

Soumyakanti Chakraborty, Anup K. Sen, Amitava Bagchi

Inf. Syst. Frontiers, 2015

2014

Experimenting with Proxy Agents in Online Combinatorial Auctions.

Soumyakanti Chakraborty, Anup Kumar Sen, Amitava Bagchi

Int. J. Intell. Inf. Technol., 2014

2012

Providing Information Feedback to Bidders in Online Multi-unit Combinatorial Auctions.

Anup K. Sen, Amitava Bagchi

Proceedings of the 18th Americas Conference on Information Systems, 2012

2011

Semantic Notions of Weakly Correct AND/XOR Business Workflows Based on Partial Synchronization.

Akhil Kumar, Anup K. Sen, Meda H. Sundari, Amitava Bagchi

Proceedings of the IEEE International Conference on Services Computing, 2011

2010

On Detecting Data Flow Errors in Workflows.

Hema S. Meda, Anup K. Sen, Amitava Bagchi

ACM J. Data Inf. Qual., 2010

2009

Designing Proxy Bidders for Online Combinatorial Auctions.

Soumyakanti Chakraborty, Anup K. Sen, Amitava Bagchi

Proceedings of the 42st Hawaii International International Conference on Systems Science (HICSS-42 2009), 2009

Revaluation of Bundles by Bidders in Combinatorial Auctions.

Soumyakanti Chakraborty, Anup K. Sen, Amitava Bagchi

Proceedings of the 42st Hawaii International International Conference on Systems Science (HICSS-42 2009), 2009

2008

Bidder Valuation of Bundles in Combinatorial Auctions.

Soumyakanti Chakraborty, Anup K. Sen, Amitava Bagchi

Proceedings of the 41st Hawaii International International Conference on Systems Science (HICSS-41 2008), 2008

2007

The representation, analysis and verification of business processes: a metagraph-based approach.

Arindam Mukherjee, Anup K. Sen, Amitava Bagchi

Inf. Technol. Manag., 2007

On estimating the time taken to rectify faults in a software package during the system testing phase.

Rahul Roy, Amitava Bagchi

Inf. Process. Lett., 2007

Improving Linkage of Web Pages.

Rakesh Gupta, Amitava Bagchi, Sumit Sarkar

INFORMS J. Comput., 2007

2006

Time Delay in Rectification of Faults in Software Projects.

Rahul Roy, Amitava Bagchi

Proceedings of the International Conference on Information Systems, 2006

2004

Average-case analysis of best-first search in two representative directed acyclic graphs.

Anup K. Sen, Amitava Bagchi, Weixiong Zhang

Artif. Intell., 2004

The Development, Testing, and Release of Software Systems in the Internet Age: A Generalized Analytical Model.

Rahul Roy, Amitava Bagchi

Proceedings of the International Conference on Information Systems, 2004

2003

Tuning the Quality Parameters of a Firewall to Maximize Net Benefit.

Wei T. Yue, Amitava Bagchi

Proceedings of the Distributed Computing, 2003

Internet Auctions: Some Issues and Problems.

Amitava Bagchi, Atul Saroop

Proceedings of the Distributed Computing, 2003

2002

An Average-Case Analysis of Graph Search.

Anup K. Sen, Amitava Bagchi, Weixiong Zhang

Proceedings of the Eighteenth National Conference on Artificial Intelligence and Fourteenth Conference on Innovative Applications of Artificial Intelligence, July 28, 2002

1999

The multiple resource constrained project scheduling problem: A breadth-first approach.

Terence Nazareth, Sanjay Verma, Subir Bhattacharya, Amitava Bagchi

Eur. J. Oper. Res., 1999

1996

Searching graphs with A*: applications to job sequencing.

Anup K. Sen, Amitava Bagchi, Ramkumar Ramaswamy

IEEE Trans. Syst. Man Cybern. Part A, 1996

Graph Search Methods for Non-Order-Preserving Evaluation Functions: Applications to Job Sequencing Problems.

Anup K. Sen, Amitava Bagchi

Artif. Intell., 1996

Searching Game Trees Under Memory Constraints.

Subir Bhattacharya, Amitava Bagchi

Proceedings of the Thirteenth National Conference on Artificial Intelligence and Eighth Innovative Applications of Artificial Intelligence Conference, 1996

1994

A General Framework for Minimax Search in Game Trees.

Subir Bhattacharya, Amitava Bagchi

Inf. Process. Lett., 1994

1993

A Faster Alternative to SSS* with Extension to Variable Memory.

Subir Bhattacharya, Amitava Bagchi

Inf. Process. Lett., 1993

Non-Order-Preserving Evaluation Functions: Recursive Graph-Search Methods for Job Sequencing Problems.

Anup K. Sen, Amitava Bagchi

Proceedings of the 13th International Joint Conference on Artificial Intelligence. Chambéry, France, August 28, 1993

1992

QuickGame: A Compromise Between Pure Depth-first and Pure Best-first Game Tree Search Strategies.

Subir Bhattacharya, Amitava Bagchi

Proceedings of the Automated Reasoning, 1992

1991

Admissible Search Methods for Minimum Penalty Sequencing of Jobs with Setup Times on One and Two Machines.

Anup K. Sen, Amitava Bagchi, Bani K. Sinha

Proceedings of the 12th International Joint Conference on Artificial Intelligence. Sydney, 1991

1989

Fast Recursive Formulations for Best-First Search That Allow Controlled Use of Memory.

Anup K. Sen, Amitava Bagchi

Proceedings of the 11th International Joint Conference on Artificial Intelligence. Detroit, 1989

Searching Game Trees in Parallel Using SSS.

Subir Bhattacharya, Amitava Bagchi

Proceedings of the 11th International Joint Conference on Artificial Intelligence. Detroit, 1989

1986

Heuristic search in general tree structures: an average case analysis.

Amitava Bagchi, Anup K. Sen

Proceedings of the 14th ACM Annual Conference on Computer Science, 1986

Making Best Use of Available Memory When Searching Game Trees.

Subir Bhattacharya, Amitava Bagchi

Proceedings of the 5th National Conference on Artificial Intelligence. Philadelphia, 1986

1985

AND/OR Graph Heuristic Search Methods

A. Mahanti, Amitava Bagchi

J. ACM, January, 1985

Three Approaches to Heuristic Search in Networks

Amitava Bagchi, A. Mahanti

J. ACM, January, 1985

1983

Search Algorithms Under Different Kinds of Heuristics-A Comparative Study

Amitava Bagchi, A. Mahanti

J. ACM, January, 1983

Admissible Heuristic Search in And/Or Graphs.

Amitava Bagchi, A. Mahanti

Theor. Comput. Sci., 1983