Average Performance of Heuristics for Satisfiability

@article{Kohli1989AveragePO,
  title={Average Performance of Heuristics for Satisfiability},
  author={Rajeev Kohli and Ramesh Krishnamurti},
  journal={SIAM J. Discrete Math.},
  year={1989},
  volume={2},
  pages={508-523}
}
Distribution-free tight lower bounds on the average performance ratio for random search, for a greedy heuristic and for a probabilistic greedy heuristic are derived for an optimization version of satisfiability. On average, the random solution is never worse than ofthe optimal, regardless ofthe data-generating distribution. The lower bound on the average greedy solution is at least of the optimal, and this bound increases with the probability of the greedy heuristic selecting the optimal at… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-6 of 6 references

LOVELAND , A machine programfor theorem proving

D.
Comm . ACM • 1986

BOXMA, A probabilistic analysis ofmultiprocessing list scheduling: the erlang

O J.
case, Stochastic Models, • 1985

A machine programfor theorem proving

D. LOVELAND
Comm. ACM, • 1962

Limitingforms ofthefrequency distribution ofthe largest or smallest member ofa sample

R. A. FISHER AND L. H. C. TIPPETT
Proc . Cambridge Phil . Soc . • 1962

TIPPETT , Limitingforms ofthefrequency distribution ofthe largest or smallest member ofa sample

C. R.A.FISHERANDL.H.
Proc . Cambridge Phil . Soc . • 1962

Similar Papers

Loading similar papers…