( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Improved Bounds in Stochastic Matching and Optimization.

, , , , и . APPROX-RANDOM, том 40 из LIPIcs, стр. 124-134. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)

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.

Walid Alok

Alok Juneja

Alok Choudhury

Siri Krishan Baveja

 

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

Derivation and test of an optimum overlapping-lobes model of visual search., , , и . IEEE Trans. Syst. Man Cybern. Part A, 26 (1): 161-168 (1996)Improved Bounds in Stochastic Matching and Optimization., , , , и . APPROX-RANDOM, том 40 из LIPIcs, стр. 124-134. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Practice Summaries: An Optimization Mathematical Model for Concentrated Solar Power Financing Decisions at Lockheed Martin., , и . Interfaces, 42 (6): 591-594 (2012)The stochastic queue center problem., , и . Comput. Oper. Res., 26 (14): 1423-1436 (1999)Improved Bounds in Stochastic Matching and Optimization., , , , и . Algorithmica, 80 (11): 3225-3252 (2018)Technical Note - Improved Sample-Complexity Bounds in Stochastic Optimization., , , , и . Oper. Res., 73 (2): 986-994 (2025)Divide and Conquer: Rohm and Haas' Response to a Changing Specialty Chemicals Market., и . Interfaces, 30 (6): 1-16 (2000)Soft-system knowledge management framework for new product development., , и . J. Knowl. Manag., 13 (1): 135-153 (2009)Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems., и . Math. Oper. Res., 25 (2): 255-280 (2000)Approximating weighted completion time via stronger negative correlation., , и . J. Sched., 27 (4): 319-328 (августа 2024)