( en | de | ru )

 

Disambiguation of "Sen, Anup K."

Author of the publication

copydeleteadd this publication to your clipboard
Revaluation of Bundles by Bidders in Combinatorial Auctions.

, , and . HICSS, page 1-10. IEEE Computer Society, (2009)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Vilma Anupöld

Anup Das

Anup Pradhan

Anup Bhattacharya

Anup Ramachandran

 

Other publications of authors with the same name

An Average-Case Analysis of Graph Search., , and . AAAI/IAAI, page 757-763. AAAI Press / The MIT Press, (2002)Fast Recursive Formulations for Best-First Search That Allow Controlled Use of Memory., and . IJCAI, page 297-302. Morgan Kaufmann, (1989)Incremental solutions to online multi-unit combinatorial auctions for information feedback., , and . ASONAM, page 882-889. IEEE Computer Society, (2014)The Chronon Based Model for Temporal Databases., and . DASFAA, volume 4947 of Lecture Notes in Computer Science, page 461-469. Springer, (2008)Providing Information Feedback to Bidders in Online Multi-unit Combinatorial Auctions., and . AMCIS, Association for Information Systems, (2012)Admissible Search Methods for Minimum Penalty Sequencing of Jobs with Setup Times on One and Two Machines., , and . IJCAI, page 178-183. Morgan Kaufmann, (1991)Addressing the valuation problem in multi-round combinatorial auctions., , and . Inf. Syst. Frontiers, 17 (5): 1145-1160 (2015)Revaluation of Bundles by Bidders in Combinatorial Auctions., , and . HICSS, page 1-10. IEEE Computer Society, (2009)Non-Order-Preserving Evaluation Functions: Recursive Graph-Search Methods for Job Sequencing Problems., and . IJCAI, page 1423-1429. Morgan Kaufmann, (1993)Greedy by Chance - Stochastic Greedy Algorithms., and . ICAS, page 182-187. IEEE Computer Society, (2010)