( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Greedy by Chance - Stochastic Greedy Algorithms.

, и . ICAS, стр. 182-187. IEEE Computer Society, (2010)

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.

Vilma Anupöld

Anup Das

Anup Pradhan

Anup Bhattacharya

Anup Biswas

 

Другие публикации лиц с тем же именем

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