( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Measuring the Robustness of Resource Allocations in a Stochastic Dynamic Environment.

, , , , , , , , , , , , и . IPDPS, стр. 1-10. IEEE, (2007)

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.

Andrew M Gaskievicz

William Banks Sutton

Andrew Huvos

Andrew Lee

Andrew Cato

 

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

MosaiCode: Visualizing large scale software: A tool demonstration., , , , , и . VISSOFT, стр. 1-4. IEEE Computer Society, (2011)Evolving Solutions to Community-Structured Satisfiability Formulas., и . AAAI, стр. 2346-2353. AAAI Press, (2019)Elementary landscapes: theory and applications., и . GECCO (Companion), стр. 545-566. ACM, (2013)Approximation Speed-Up by Quadratization on LeadingOnes., и . PPSN (2), том 12270 из Lecture Notes in Computer Science, стр. 686-698. Springer, (2020)Evolving Populations of Solved Subgraphs with Crossover and Constraint Repair., и . PPSN (3), том 15150 из Lecture Notes in Computer Science, стр. 133-148. Springer, (2024)Fitness Probability Distribution of Bit-Flip Mutation., , , и . Evol. Comput., 23 (2): 217-248 (2015)Mutation rates of the (1+1)-EA on pseudo-boolean functions of bounded epistasis., , и . GECCO, стр. 973-980. ACM, (2011)Understanding elementary landscapes., , и . GECCO, стр. 585-592. ACM, (2008)Recovering UML class models from C++: A detailed explanation., и . Inf. Softw. Technol., 49 (3): 212-229 (2007)Lower Bounds on the Runtime of Crossover-Based Algorithms via Decoupling and Family Graphs., и . Algorithmica, 83 (10): 3180-3208 (2021)