A Constraint-Based Model for Fast Post-Disaster Emergency Vehicle Routing, International Journal of Interactive Multimedia and Artificial Intelligence, vol.2, issue.4, pp.67-75, 2013. ,
DOI : 10.9781/ijimai.2013.248
URL : https://hal.archives-ouvertes.fr/hal-00909296
An Empirical Evaluation of Portfolios Approaches for Solving CSPs, CPAIOR, pp.316-324, 2013. ,
DOI : 10.1007/978-3-642-38171-3_21
URL : https://hal.archives-ouvertes.fr/hal-00909297
An enhanced features extractor for a portfolio of constraint solvers, Proceedings of the 29th Annual ACM Symposium on Applied Computing, SAC '14, pp.1357-1359, 2014. ,
DOI : 10.1145/2554850.2555114
URL : https://hal.archives-ouvertes.fr/hal-01089183
Abstract, Theory and Practice of Logic Programming, vol.41, issue.4-5, pp.4-5, 2014. ,
DOI : 10.1007/s10601-008-9051-2
A Multicore Tool for Constraint Solving, IJCAI, pp.232-238, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01227592
Sequential Time Splitting and Bounds Communication for a Portfolio of Optimization Solvers, CP, pp.108-124, 2014. ,
DOI : 10.1007/978-3-319-10428-7_11
URL : https://hal.archives-ouvertes.fr/hal-01091664
Why CP Portfolio Solvers Are (under)Utilized? Issues and Challenges, LOPSTR, pp.349-364, 2015. ,
DOI : 10.1007/978-3-319-27436-2_21
URL : https://hal.archives-ouvertes.fr/hal-01227598
A survey of cross-validation procedures for model selection, Statistics Surveys, vol.4, issue.0, pp.40-79, 2010. ,
DOI : 10.1214/09-SS054
URL : https://hal.archives-ouvertes.fr/hal-00407906
ASlib: A benchmark library for algorithm selection, Artificial Intelligence, vol.237, 2015. ,
DOI : 10.1016/j.artint.2016.04.003
Model Expansion in the Presence of Function Symbols Using Constraint Programming, ICTAI, pp.1068-1075, 2013. ,
Making Choices Using Structure at the Instance Level within a??Case Based Reasoning Framework, CPAIOR, pp.380-386, 2004. ,
DOI : 10.1007/978-3-540-24664-0_27
Learning when to use lazy learning in constraint solving, ECAI, pp.873-878, 2010. ,
Algorithm portfolios, Artificial Intelligence, vol.126, issue.1-2, pp.43-62, 2001. ,
DOI : 10.1016/S0004-3702(00)00081-3
The WEKA data mining software, ACM SIGKDD Explorations Newsletter, vol.11, issue.1, 2009. ,
DOI : 10.1145/1656274.1656278
Advances in algorithm selection for answer set programming, TPLP, vol.2, issue.14, pp.4-5, 2014. ,
From Sequential Algorithm Selection to Parallel Portfolio Selection, In LION LNCS, vol.8426, pp.21-35, 2015. ,
An economics approach to hard computational problems, Science, vol.275, issue.5296, pp.51-54, 1997. ,
Proteus: A Hierarchical Portfolio of Solvers and Transformations, CPAIOR, pp.301-317, 2014. ,
DOI : 10.1007/978-3-319-07046-9_22
Identifying Key Algorithm Parameters and Instance Features Using Forward Selection, In LION LNCS, vol.7997, pp.364-381, 2013. ,
DOI : 10.1007/978-3-642-44973-4_40
Algorithm runtime prediction: Methods & evaluation, Artificial Intelligence, vol.206, pp.79-111, 2014. ,
DOI : 10.1016/j.artint.2013.10.003
Algorithm Selection and Scheduling, CP, 2011. ,
DOI : 10.1007/978-3-642-23786-7_35
ISAC -Instance-Specific Algorithm Configuration, ECAI, 2010. ,
Generalized NoGoods in CSPs, AAAI, pp.390-396, 2005. ,
Resolution and parallelizability: Barriers to the efficient parallelization of SAT solvers, AAAI, 2013. ,
Algorithm Selection for Combinatorial Search Problems: A Survey, AI Magazine, vol.17, issue.10, pp.48-60, 2014. ,
DOI : 10.1007/978-3-642-31612-8_18
Feature Filtering for Instance-Specific Algorithm Configuration, 2011 IEEE 23rd International Conference on Tools with Artificial Intelligence, pp.849-855, 2011. ,
DOI : 10.1109/ICTAI.2011.132
Consistency in networks of relations, Consistency in Networks of Relations, pp.99-118, 1977. ,
DOI : 10.1016/0004-3702(77)90007-8
Evolving Instance-Specific Algorithm Configuration, SOCS, 2013. ,
DOI : 10.1007/978-3-319-11230-5_9
Parallel SAT Solver Selection and Scheduling, CP, pp.512-526, 2012. ,
DOI : 10.1007/978-3-642-33558-7_38
Algorithm Portfolios Based on Cost- Sensitive Hierarchical Clustering, IJCAI. IJCAI/AAAI, 2013. ,
Instance-Specific Algorithm Configuration as a Method for Non-Model-Based Portfolio Generation, CPAIOR, 2012. ,
DOI : 10.1007/978-3-642-29828-8_16
Automatically configuring constraint satisfaction programs: A case study, Constraints, vol.58, issue.1, pp.7-43, 1996. ,
DOI : 10.1007/BF00143877
MiniZinc: Towards a Standard CP Modelling Language, CP, 2007. ,
DOI : 10.1007/978-3-540-74970-7_38
Instance-Based Selection of Policies for SAT Solvers, SAT, pp.326-340, 2009. ,
DOI : 10.1007/978-3-540-74970-7_50
Using case-based reasoning in an algorithm portfolio for constraint solving, AICS, 2008. ,
GLOA: A New Job Scheduling Algorithm for Grid Computing, International Journal of Interactive Multimedia and Artificial Intelligence, vol.2, issue.1, pp.59-64, 2013. ,
DOI : 10.9781/ijimai.2013.218
A Multi-engine Solver for Quantified Boolean Formulas, CP, pp.574-589, 2007. ,
DOI : 10.1007/978-3-540-74970-7_41
A self-adaptive multi-engine solver for quantified Boolean formulas, Constraints, vol.2, issue.1, pp.80-116, 2009. ,
DOI : 10.1007/s10601-008-9051-2
The Algorithm Selection Problem, Advances in Computers, vol.15, pp.65-118, 1976. ,
DOI : 10.1016/S0065-2458(08)60520-3
XML Representation of Constraint Networks: Format XCSP 2.1. CoRR, abs/0902, p.2362, 2009. ,
URL : https://hal.archives-ouvertes.fr/hal-00872825
Insights into Parallelism with Intensive Knowledge Sharing, CP, pp.655-671, 2014. ,
DOI : 10.1007/978-3-319-10428-7_48
Snappy: A Simple Algorithm Portfolio, SAT, pp.422-428, 2013. ,
DOI : 10.1007/978-3-642-39071-5_33
Automatic configuration of sequential planning portfolios, AAAI, pp.3364-3370, 2015. ,
Cross-disciplinary perspectives on meta-learning for algorithm selection, ACM Computing Surveys, vol.41, issue.1, 2008. ,
DOI : 10.1145/1456650.1456656
Heuristics for dynamically adapting propagation in constraint satisfaction problems, AI Commun, vol.22, issue.3, pp.125-141, 2009. ,
Short portfolio training for CSP solving. CoRR, abs, 1505. ,
Philosophy of the MiniZinc challenge, Constraints, vol.15, issue.3, pp.307-316, 2010. ,
SATzilla2012: Improved algorithm selection based on cost-sensitive classification models. Solver description, SAT Challenge, 2012. ,
Evaluating Component Solver Contributions to Portfolio-Based Algorithm Selectors, SAT, pp.228-241, 2012. ,
DOI : 10.1007/978-3-642-31612-8_18
The design and analysis of an algorithm portfolio for sat, CP, pp.712-727, 2007. ,
Satzilla: Portfolio-based algorithm selection for SAT, JAIR, vol.32, pp.565-606, 2008. ,