Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. Cook, S.A.: The complexity of theorem-proving procedures. In: Proceedings of 3rd Annual ACM Symp. Theory of Computing, pp. 151–158 (1971)
2. Lecture Notes in Computer Science;A. Fukunaga,2005
3. Gent, I., Walsh, T.: Towards an understanding of hill-climbing procedures for SAT. In: Proceedings of AAAI 1993 (1993)
4. Hirsch, E.A., Kojevnikov, A.: Unitwalk: A new sat solver that uses local search guided by unit clause elimination. Annals of Mathematics and Artificial Intelligence 43(1-4), 91–111 (2005)
5. Hoos, H.: On the run-time behavior of stochastic local search algorithms for sat. In: Proceedings of AAAI 1999, pp. 661–666 (1999)
Cited by
48 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Beyond Pairwise Testing: Advancing 3-wise Combinatorial Interaction Testing for Highly Configurable Systems;Proceedings of the 33rd ACM SIGSOFT International Symposium on Software Testing and Analysis;2024-09-11
2. CAmpactor: A Novel and Effective Local Search Algorithm for Optimizing Pairwise Covering Arrays;Proceedings of the 31st ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering;2023-11-30
3. SamplingCA: effective and efficient sampling-based pairwise testing for highly configurable software systems;Proceedings of the 30th ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering;2022-11-07
4. Improving probability selection based weights for satisfiability problems;Knowledge-Based Systems;2022-06
5. Stock Industry Analysis Based on Visibility Graph;Advances in Applied Mathematics;2022