From post

Scaling up Local Search for Minimum Vertex Cover in Large Graphs by Parallel Kernelization.

, , , и . Australasian Conference on Artificial Intelligence, том 10400 из Lecture Notes in Computer Science, стр. 131-143. Springer, (2017)

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.

 

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

Escaping Local Optima Using Crossover with Emergent Diversity, , , , , , , и . IEEE Transactions on Evolutionary Computation, (августа 2017)Concentration of First Hitting Times Under Additive Drift.. Algorithmica, 75 (3): 490-506 (2016)Cautious Limit Learning., и . ALT, том 117 из Proceedings of Machine Learning Research, стр. 251-276. PMLR, (2020)Ants easily solve stochastic shortest path problems., , и . GECCO, стр. 17-24. ACM, (2012)Difficulties in Forcing Fairness of Polynomial Time Inductive Inference., и . ALT, том 5809 из Lecture Notes in Computer Science, стр. 263-277. Springer, (2009)Feasible Iteration of Feasible Learning Functionals., , и . ALT, том 4754 из Lecture Notes in Computer Science, стр. 34-48. Springer, (2007)Unbiased Black-Box Complexities of Jump Functions., , и . Evol. Comput., 23 (4): 641-670 (2015)Analysis of the (1+1) EA on LeadingOnes with Constraints., , , , и . CoRR, (2023)Multiplicative up-drift., и . GECCO, стр. 1470-1478. ACM, (2019)Enlarging Learnable Classes., , и . ALT, том 7568 из Lecture Notes in Computer Science, стр. 36-50. Springer, (2012)