A General Framework Based on Machine Learning for Algorithm Selection in Constraint Satisfaction Problems
Many of the works conducted on algorithm selection strategies—methods that choose a suitable solving method for a particular problem—start from scratch since only a few investigations on reusable components of such methods are found in the literature. Additionally, researchers might unintentionally...
Main Authors: | José C. Ortiz-Bayliss, Ivan Amaya, Jorge M. Cruz-Duarte, Andres E. Gutierrez-Rodriguez, Santiago E. Conant-Pablos, Hugo Terashima-Marín |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2021-03-01
|
Series: | Applied Sciences |
Subjects: | |
Online Access: | https://www.mdpi.com/2076-3417/11/6/2749 |
Similar Items
-
A Novel Strategy of Combining Variable Ordering Heuristics for Constraint Satisfaction Problems
by: Hongbo Li, et al.
Published: (2018-01-01) -
Exploring the Impact of Early Decisions in Variable Ordering for Constraint Satisfaction Problems
by: José Carlos Ortiz-Bayliss, et al.
Published: (2018-01-01) -
An Empirical Study of Distributed Constraint Satisfaction Algorithms
by: Mohamed, Younis
Published: (2011) -
Experimental Matching of Instances to Heuristics for Constraint Satisfaction Problems
by: Jorge Humberto Moreno-Scott, et al.
Published: (2016-01-01) -
Integrating Probabilistic Reasoning with Constraint Satisfaction
by: Hsu, Eric
Published: (2011)