원문정보
보안공학연구지원센터(IJHIT)
International Journal of Hybrid Information Technology
Vol.7 No.2
2014.03
pp.191-202
초록
영어
Random constraint satisfaction problem models play a significant role in computer science. They provide instances for benchmarking algorithms, help inform the design of algorithms and heuristics, and provide insight into problem hardness. In this paper, model RA which was revised from classical model A, was studied. When parameter k satisfied k ≥ 3, model RA has the same satisfiability transition with model RB, which was revised from classical model B and has already got considerable theoretical and practical studies. We also compared the performances of fundamental algorithms on model RA with on model RB.
목차
Abstract
1. Introduction
2. Revised models
3. Satisfiability Transition on model RA
4. Experiments on model RA and RB
5. Conclusion
References
1. Introduction
2. Revised models
3. Satisfiability Transition on model RA
4. Experiments on model RA and RB
5. Conclusion
References
저자정보
참고문헌
자료제공 : 네이버학술정보
- 1(Reference title not available)
- 2(Reference title not available)
- 3Probabilistic analysis of two heuristics for the 3-satisfiability problem네이버 원문 이동
- 4(Reference title not available)
- 5(Reference title not available)
- 6(Reference title not available)
- 7On the satisfiability and maximum satisfiability of random 3-CNF formulas네이버 원문 이동
- 8Where the really hard problems are네이버 원문 이동
- 9(Reference title not available)
- 10Locating the phase transition in binary constraint satisfaction problems네이버 원문 이동