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 “"Probabilistic Analysis of Max 3-Satisfiability"”.

  1. A Probabilistic Study of 3-SATISFIABILITY

    … problems are defined by a finite set of solutions together with an objective function value assigned to each solution. Local search algorithms provide useful tools for addressing a wide variety of intractable discrete optimization problems. Each such algorithm offers a distinct set of

    vt Repository record for A Probabilistic Study of 3-SATISFIABILITY (opens in a new tab)