Information Technology Reference
In-Depth Information
Proceedings of The 19th Irish Conference on Artificial Intelligence and Cognitive Science
,
Ireland, August 2008
Pérez, O.J., Pazos, R.A., Frausto, J., Rodríguez, G., Romero, D., Cruz, L. (2004). A Statistical
Approach for Algorithm Selection.
Lectures Notes in Computer Science
, Vol. 3059,
(May 2004) pp. 417-431, ISSN: 0302-9743
Pérez, J., Pazos, R.A., Vélez, L. Rodríguez, G. (2002). Automatic Generation of Control
Parameters for the Threshold Accepting Algorithm.
Lectures Notes in Computer
Science
, Vol. 2313, pp. 119-127
Quiroz, M. (2009).
Caracterización de Factores de Desempeño de Algoritmos de Solución de BPP
.
Master´s thesis, Instituto Tecnológico de Cd. Madero, Tamaulipas, México
Reeves, C. (1993).
Modern heuristic techniques for combinatorial problems
. John Wiley & Sons,
ISBN: 0-470-22079-1, New York, USA
Rice, J. R. (1976). The algorithm selection problem.
Advances in Computers
, Vol. 15, pp. 65-118
Rice, J.R. (1968). On the Construction of Poly-algorithms for Automatic Numerical Analysis.
Interactive System for Experimental Applied Mathematics
, M. Klerer & J. Reinfelds,
(Ed.) Academic Press, Burlington, MA, pp. 301-313
Ruiz-Vanoye, J. A., Pérez, J., Pazos, R. A., Zarate, J. A., Díaz-Parra, O., & Zavala-Díaz, J. C.
(2009). Statistical Complexity Indicators Applied to the Vehicle Routing Problem
with Time Windows for Discriminate Appropriately the Best Algorithm,
Journal of
Computer Science and Software Technology
, Vol. 2, No. 2, ISSN: 0974-3898
Samulowitz, H. & Memisevic, R. (2007). Learning to solve QBF. In:
AAAI-07
, pp. 255-260,
retrieved from: https://www.aaai.org/Papers/AAAI/2007/AAAI07-039.pdf
Schiavinotto, T. & Stützle, T. (2007). A review of metrics on permutations for search
landscape analysis.
Computers & Operations Research
, Vol. 34, No. 10, (October 2007),
pp. 3143-3153
Silverthorn, B. & Miikkulainen, R. (2010). Latent Class Models for Algorithm Portfolio
Methods.
Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence
Smith-Miles, K. & Lopes, L. (2012). Measuring instance difficulty for combinatorial
optimization problems.
Computers & Operations Research
, in press (accepted 6/7/11)
Smith-Miles, K.; James, R.; Giffin, J. & Tu, Y. (2009). Understanding the relationship between
scheduling problem structure and heuristic performance using knowledge
discovery. In:
Learning and Intelligent Optimization,
LION-3, Vol. 3, Available from:
lion.disi.unitn.it/intelligent-optimization/LION3/online_proceedings/35.pdf
Soares, C. & Pinto, J. (2003). Ranking Learning Algorithms: Using IBL and Meta-Learning on
Accuracy and Time Results.
Machine Learning
, Vol. 50, No. 3, pp. 251-277
Streeter, M; Golovin, D. & Smith, S. F. (2007). Combining multiple heuristics online. In:
AAAI 2007
,
Proceedings of the 22nd national conference on Artificial intelligence
, Vol. 22,
Anthony Cohn, pp. 1197-1203, AAAI Press, Retrieved from:
http://www.aaai.org/Papers/AAAI/2007/AAAI07-190.pdf
Wolpert, D. H. & Macready, W. G. (1997). No free lunch theorems for optimization.
IEEE
Transactions on Evolutionary Computation
, Vol. 1, No. 1, pp. 67-82
Xu, L.; Hutter, F.; Hoos, H. & Leyton-Brown, K. (2009). SATzilla2009: An automatic
algorithm portfolio for SAT. In:
Solver description, 2009 SAT Competition
