Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms (Q693145)

From MaRDI portal
Revision as of 23:22, 22 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: author (P16): Item:Q1309808)
scientific article
Language Label Description Also known as
English
Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms
scientific article

    Statements

    Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms (English)
    0 references
    0 references
    0 references
    7 December 2012
    0 references
    0 references
    GRASP
    0 references
    metaheuristics
    0 references
    stochastic local search
    0 references
    run time distributions
    0 references
    time-to-target plots
    0 references
    path-relinking
    0 references