Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 1 of 1 for “"search space analysis"”.

  1. An analysis of combinatorial search spaces for a class of NP-hard problems

    … maximize (or minimize) ƒ. Many combinatorial search algorithms employ some perturbation operator to hill-climb in the search space. Such perturbative local search algorithms are state of the art for many classes of NP-hard combinatorial optimization problems such as maximum k-satisfiability, …

    colostate Repository record for An analysis of combinatorial search spaces for a class of NP-hard problems (opens in a new tab)