Author of the publication

Search Space Exploration and an Optimization Criterion for Hard Design Problems.

, , , and . GECCO (Companion), page 43-44. ACM, (2016)

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.

 

Other publications of authors with the same name

On Simulated Annealing Dedicated to Maximin Latin Hypercube Designs., , , and . CoRR, (2016)Multiple Canadians on the road: minimizing the distance competitive ratio., , , , , and . J. Comb. Optim., 38 (4): 1086-1100 (2019)A lower bound for weak Schur numbers with a deterministic algorithm., , , and . J. Discrete Algorithms, (2018)Restricting the search space to boost Quantum Annealing performance., , , and . CEC, page 3238-3245. IEEE, (2016)Completion of partial Latin Hypercube Designs: NP-completeness and inapproximability., , , and . Theor. Comput. Sci., (2018)On the Competitiveness of Memoryless Strategies for the k-Canadian Traveller Problem., , , and . COCOA, volume 11346 of Lecture Notes in Computer Science, page 566-576. Springer, (2018)The Competitiveness of Randomized Strategies for Canadians via Systems of Linear Inequalities., , , and . ISCIS, volume 935 of Communications in Computer and Information Science, page 96-103. Springer, (2018)Search Space Exploration and an Optimization Criterion for Hard Design Problems., , , and . GECCO (Companion), page 43-44. ACM, (2016)Current Frontiers in Computer Go., , , , , and . IEEE Trans. Comput. Intellig. and AI in Games, 2 (4): 229-238 (2010)The First Approximation Algorithm for the Maximin Latin Hypercube Design Problem., , , and . Operations Research, 66 (1): 253-266 (2018)