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 “"complexity per move"”.

  1. A step toward constant time local search for optimizing pseudo Boolean functions

    … is a common form of SLS, which always takes the move yielding the highest improvement in the objective function. Generally, the more runtime SLS is given, the better solution can be obtained. This thesis aims at algorithmically accelerating SLS for PBFs using Walsh Analysis. The contributions of …

    colostate Repository record for A step toward constant time local search for optimizing pseudo Boolean functions (opens in a new tab)