Understanding VSIDS Branching Heuristics in CDCL SAT solvers (Презентации лекций), страница 6
Описание файла
Файл "Understanding VSIDS Branching Heuristics in CDCL SAT solvers" внутри архива находится в следующих папках: Презентации лекций, Статьи к лекциям. PDF-файл из архива "Презентации лекций", который расположен в категории "". Всё это находится в предмете "boolean sat-smt solvers for software engineering" из 11 семестр (3 семестр магистратуры), которые можно найти в файловом архиве МГУ им. Ломоносова. Не смотря на прямую связь этого архива с МГУ им. Ломоносова, его также можно найти и в других разделах. .
Просмотр PDF-файла онлайн
Текст 6 страницы из PDF
pp. 343–356. SAT’11, SpringerVerlag, Berlin, Heidelberg (2011)[30] Katsirelos, G., Simon, L.: Eigenvector centrality in industrial SAT instances. In:Milano, M. (ed.) Principles and Practice of Constraint Programming, pp. 348–356.Lecture Notes in Computer Science, Springer Berlin Heidelberg (2012)[31] Kaufman, P.J.: Trading systems and methods. John Wiley & Sons (2013)[32] Mahajan, Y.S., Fu, Z., Malik, S.: Zchaff2004: An efficient SAT solver. In: Proceedings of the 7th International Conference on Theory and Applications of Satisfiability Testing.
pp. 360–375. SAT’04, Springer-Verlag, Berlin, Heidelberg (2005)[33] Marques-Silva, J.P.: The impact of branching heuristics in propositional satisfiability algorithms. In: Progress in Artificial Intelligence, pp. 62–74. Springer (1999)[34] Marques-Silva, J.P., Sakallah, K.A.: Grasp: A search algorithm for propositionalsatisfiability. Computers, IEEE Transactions on 48(5), 506–521 (1999)[35] Moskewicz, M.W., Madigan, C.F., Malik, S.: Method and system for efficientimplementation of boolean satisfiability (Aug 26 2008), uS Patent 7,418,369[36] Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient SAT solver. In: Proceedings of the 38th Annual Design AutomationConference.
pp. 530–535. DAC ’01, ACM, New York, NY, USA (2001)[37] Nadel, A., Ryvchin, V.: Assignment stack shrinking. In: Theory and Applicationsof Satisfiability Testing–SAT 2010, pp. 375–381. Springer (2010)[38] Newsham, Z., Ganesh, V., Fischmeister, S., Audemard, G., Simon, L.: Impact ofcommunity structure on SAT solver performance. In: Theory and Applications ofSatisfiability Testing–SAT 2014, pp.
252–268. Springer (2014)[39] Pipatsrisawat, K., Darwiche, A.: On the power of clause-learning SAT solverswith restarts. In: Principles and Practice of Constraint Programming-CP 2009,pp. 654–668. Springer (2009)[40] Spearman, C.: The proof and measurement of association between two things.The American journal of psychology 15(1), 72–101 (1904)[41] Straffin, P.D.: Linear algebra in geography: Eigenvectors of networks. Mathematics Magazine 53(5), 269–276 (1980)[42] Yu, P.S., Li, X., Liu, B.: Adding the temporal dimension to search - a case studyin publication search.
In: Skowron, A., Agrawal, R., Luck, M., Yamaguchi, T.,Morizet-Mahoudeaux, P., Liu, J., Zhong, N. (eds.) Web Intelligence. pp. 543–549.IEEE Computer Society (2005)[43] Zhang, W., Pan, G., Wu, Z., Li, S.: Online community detection for large complexnetworks. In: Proceedings of the Twenty-Third international joint conference onArtificial Intelligence.
pp. 1903–1909. AAAI Press (2013).
