Amitava Bagchi - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 31 from 31

2020

Designing information feedback for bidders in multi-item multi-unit combinatorial auctionsAnup K. Sen, Amitava Bagchi, Soumyakanti Chakraborty. dss, 130:113230, 2020. [doi]

2015

Addressing the valuation problem in multi-round combinatorial auctionsSoumyakanti Chakraborty, Anup K. Sen, Amitava Bagchi. isf, 17(5):1145-1160, 2015. [doi]

2014

Experimenting with Proxy Agents in Online Combinatorial AuctionsSoumyakanti Chakraborty, Anup Kumar Sen, Amitava Bagchi. ijiit, 10(2):56-75, 2014. [doi]

2012

Providing Information Feedback to Bidders in Online Multi-unit Combinatorial AuctionsAnup K. Sen, Amitava Bagchi. amcis 2012: [doi]

2011

Semantic Notions of Weakly Correct AND/XOR Business Workflows Based on Partial SynchronizationAkhil Kumar, Anup K. Sen, Meda H. Sundari, Amitava Bagchi. IEEEscc 2011: 128-135 [doi]

2010

On Detecting Data Flow Errors in WorkflowsHema S. Meda, Anup K. Sen, Amitava Bagchi. jdiq, 2(1), 2010. [doi]

2009

Designing Proxy Bidders for Online Combinatorial AuctionsSoumyakanti Chakraborty, Anup K. Sen, Amitava Bagchi. hicss 2009: 1-10 [doi]

Revaluation of Bundles by Bidders in Combinatorial AuctionsSoumyakanti Chakraborty, Anup K. Sen, Amitava Bagchi. hicss 2009: 1-10 [doi]

2008

Bidder Valuation of Bundles in Combinatorial AuctionsSoumyakanti Chakraborty, Anup K. Sen, Amitava Bagchi. hicss 2008: 51 [doi]

2007

Improving Linkage of Web PagesRakesh Gupta, Amitava Bagchi, Sumit Sarkar. informs, 19(1):127-136, 2007. [doi]

The representation, analysis and verification of business processes: a metagraph-based approachArindam Mukherjee, Anup K. Sen, Amitava Bagchi. itm, 8(1):65-81, 2007. [doi]

On estimating the time taken to rectify faults in a software package during the system testing phaseRahul Roy, Amitava Bagchi. ipl, 104(5):168-172, 2007. [doi]

2006

Time Delay in Rectification of Faults in Software ProjectsRahul Roy, Amitava Bagchi. icis 2006: 14 [doi]

2004

The Development, Testing, and Release of Software Systems in the Internet Age: A Generalized Analytical ModelRahul Roy, Amitava Bagchi. icisc 2004: 399-412

Average-case analysis of best-first search in two representative directed acyclic graphsAnup K. Sen, Amitava Bagchi, Weixiong Zhang. ai, 155(1-2):183-206, 2004. [doi]

2003

Internet Auctions: Some Issues and ProblemsAmitava Bagchi, Atul Saroop. iwdc 2003: 112-119 [doi]

Tuning the Quality Parameters of a Firewall to Maximize Net BenefitWei T. Yue, Amitava Bagchi. iwdc 2003: 321-329 [doi]

2002

An Average-Case Analysis of Graph SearchAnup K. Sen, Amitava Bagchi, Weixiong Zhang. AAAI 2002: 757

1999

The multiple resource constrained project scheduling problem: A breadth-first approachTerence Nazareth, Sanjay Verma, Subir Bhattacharya, Amitava Bagchi. eor, 112(2):347-366, 1999. [doi]

1996

Searching Game Trees Under Memory ConstraintsSubir Bhattacharya, Amitava Bagchi. AAAI 1996: 222-227

Graph Search Methods for Non-Order-Preserving Evaluation Functions: Applications to Job Sequencing ProblemsAnup K. Sen, Amitava Bagchi. ai, 86(1):43-73, 1996. [doi]

Searching graphs with A*: applications to job sequencingAnup K. Sen, Amitava Bagchi, Ramkumar Ramaswamy. tsmc, 26(1):168-173, 1996. [doi]

1994

A General Framework for Minimax Search in Game TreesSubir Bhattacharya, Amitava Bagchi. ipl, 52(6):295-301, 1994.

1993

A Faster Alternative to SSS* with Extension to Variable MemorySubir Bhattacharya, Amitava Bagchi. ipl, 47(4):209-214, 1993.

Non-Order-Preserving Evaluation Functions: Recursive Graph-Search Methods for Job Sequencing ProblemsAnup K. Sen, Amitava Bagchi. IJCAI 1993: 1423-1429

1992

QuickGame: A Compromise Between Pure Depth-first and Pure Best-first Game Tree Search StrategiesSubir Bhattacharya, Amitava Bagchi. iwar 1992: 211-220

1991

Admissible Search Methods for Minimum Penalty Sequencing of Jobs with Setup Times on One and Two MachinesAnup K. Sen, Amitava Bagchi, Bani K. Sinha. IJCAI 1991: 178-183

1989

Searching Game Trees in Parallel Using SSSSubir Bhattacharya, Amitava Bagchi. IJCAI 1989: 42-47

Fast Recursive Formulations for Best-First Search That Allow Controlled Use of MemoryAnup K. Sen, Amitava Bagchi. IJCAI 1989: 297-302

1986

Heuristic search in general tree structures: an average case analysisAmitava Bagchi, Anup K. Sen. acm 1986: 309-318 [doi]

Making Best Use of Available Memory When Searching Game TreesSubir Bhattacharya, Amitava Bagchi. AAAI 1986: 163-167

Sign in or sign up to see more results.

runs on WebDSL