Testing heuristics: We have it all wrong
暂无分享,去创建一个
[1] Bengt Aspvall,et al. Recognizing Disguised NR(1) Instances of the Satisfiability Problem , 1980, J. Algorithms.
[2] Peter C. Cheeseman,et al. Where the Really Hard Problems Are , 1991, IJCAI.
[3] T. Larrabee,et al. EVIDENCE FOR A SATISFIABILITY THRESHOLD FOR RANDOM 3CNF FORMULAS , 1992 .
[4] Hector J. Levesque,et al. Hard and Easy Distributions of SAT Problems , 1992, AAAI.
[5] John N. Hooker,et al. Detecting Embedded Horn Structure in Propositional Logic , 1992, Inf. Process. Lett..
[6] James M. Crawford,et al. Experimental Results on the Crossover Point inSatis ability , 1993 .
[7] John N. Hooker,et al. Needed: An Empirical Science of Algorithms , 1994, Oper. Res..
[8] Roy E. Marsten,et al. Feature Article - Interior Point Methods for Linear Programming: Computational State of the Art , 1994, INFORMS J. Comput..
[9] Gerald L. Thompson,et al. A Computational Study of Satisfiability Algorithms for Propositional Logic , 1994, INFORMS J. Comput..
[10] Toby Walsh,et al. The SAT Phase Transition , 1994, ECAI.
[11] J. Hooker,et al. Branching Rules for Satissability , 1995 .
[12] Catherine C. McGeoch. Feature Article - Toward an Experimental Method for Algorithm Simulation , 1996, INFORMS J. Comput..