An empirical study of branching heuristics through the lens of global learning rate
From MaRDI portal
Publication:1680251
DOI10.1007/978-3-319-66263-3_8zbMath1496.68304OpenAlexW2745105271MaRDI QIDQ1680251
V. K. Hari Govind, Pascal Poupart, Krzysztof Czarnecki, Vijay Ganesh, Jia Hui Liang
Publication date: 15 November 2017
Full work available at URL: https://doi.org/10.1007/978-3-319-66263-3_8
Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
Nonexistence Certificates for Ovals in a Projective Plane of Order Ten ⋮ Complex Golay pairs up to length 28: a search via computer algebra and programmatic SAT ⋮ The SAT+CAS method for combinatorial search with applications to best matrices ⋮ Applying computer algebra systems with SAT solvers to the Williamson conjecture ⋮ Improved Cross-Validation for Classifiers that Make Algorithmic Choices to Minimise Runtime Without Compromising Output Correctness
Uses Software
