Phase Transition in Finding Multiple Solutions in Constraint Satisfaction Problems
暂无分享,去创建一个
[1] Barbara M. Smith,et al. The Phase Transition and the Mushy Region in Constraint Satisfaction Problems , 1994, ECAI.
[2] Patrick Prosser,et al. HYBRID ALGORITHMS FOR THE CONSTRAINT SATISFACTION PROBLEM , 1993, Comput. Intell..
[3] John Gaschnig,et al. A General Backtrack Algorithm That Eliminates Most Redundant Tests , 1977, IJCAI.
[4] Patrick Prosser,et al. Binary Constraint Satisfaction Problems: Some are Harder than Others , 1994, ECAI.
[5] Barbara M. Smith. In Search of Exceptionally Difficult Constraint Satisfaction Problems , 1995, Constraint Processing, Selected Papers.
[6] Hector J. Levesque,et al. Hard and Easy Distributions of SAT Problems , 1992, AAAI.
[7] Peter C. Cheeseman,et al. Where the Really Hard Problems Are , 1991, IJCAI.
[8] James M. Crawford,et al. Experimental Results on the Crossover Point inSatis ability , 1993 .
[9] Eugene C. Freuder. A Sufficient Condition for Backtrack-Free Search , 1982, JACM.
[10] Toby Walsh,et al. The SAT Phase Transition , 1994, ECAI.
[11] Tad Hogg,et al. Exploiting the Deep Structure of Constraint Problems , 1994, Artif. Intell..
[12] Robert M. Haralick,et al. Increasing Tree Search Efficiency for Constraint Satisfaction Problems , 1979, Artif. Intell..
[13] Martin E. Dyer,et al. Locating the Phase Transition in Binary Constraint Satisfaction Problems , 1996, Artif. Intell..
[14] Toby Walsh,et al. Easy Problems are Sometimes Hard , 1994, Artif. Intell..