( en | de | ru )

 

Disambiguation of "Thomson, Sarah L."

Author of the publication

copydeleteadd this publication to your clipboard
Comparing communities of optima with funnels in combinatorial fitness landscapes.

, , and . GECCO, page 377-384. ACM, (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. You can also use the button next to the name to display some publications already assigned to the person.

Sarah L Beringer

Nabil Sarah

Erhard Thomson

Mark Thomson

Harry Thomson

 

Other publications of authors with the same name

Where the Really Hard Quadratic Assignment Problems Are: the QAP-SAT instances., , and . CoRR, (2024)Too Constrained for Genetic Algorithms too Hard for Evolutionary Computing the Traveling Tournament Problem., , and . IJCCI, page 246-257. SCITEPRESS, (2023)The Opaque Nature of Intelligence and the Pursuit of Explainable AI., , , and . IJCCI, page 555-564. SCITEPRESS, (2023)From Fitness Landscapes to Explainable AI and Back., , , and . GECCO Companion, page 1663-1667. ACM, (2023)Fractal Dimension and Perturbation Strength: A Local Optima Networks View., , and . PPSN (1), volume 13398 of Lecture Notes in Computer Science, page 562-574. Springer, (2022)The fractal geometry of fitness landscapes at the local optima level., , and . Nat. Comput., 21 (2): 317-333 (2022)On funnel depths and acceptance criteria in stochastic local search., and . GECCO, page 287-295. ACM, (2022)Randomness in Local Optima Network Sampling., , , and . GECCO Companion, page 2099-2107. ACM, (2023)Inferring Future Landscapes: Sampling the Local Optima Level., , , and . Evol. Comput., 28 (4): 621-641 (2020)Universally Hard Hamiltonian Cycle Problem Instances., , and . IJCCI, page 105-111. SCITEPRESS, (2022)