Programming by optimization

Communications of the ACM

Volumn 55, Issue 2, 2012, Pages 70-80

  Hoos, Holger H ^a  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

DESIGN SPACES; GENERIC PROGRAMMING LANGUAGES; LARGE DESIGNS; PARALLEL VERSION; USE CONTEXT;

LEAD OXIDE; OPTIMIZATION; SPECIFICATIONS;

DESIGN;

EID: 84856827305     PISSN: 00010782     EISSN: 15577317     Source Type: Journal    
DOI: 10.1145/2076450.2076469     Document Type: Article

References (40)

1. Adenso-Diaz, B. and Laguna, M. Fine-tuning of algorithms using fractional experimental design and local search. Operations Research 54, 1 (Jan.-Feb. 2006), 99-114.
2. Babic, D. and Hu, A.J. Structural abstraction of software verification conditions. In Proceedings of the 19th International Computer Aided Verification Conference, Vol. 4590 LNCS. Springer-Verlag, Berlin/ Heidelberg, 2007, 366-378.
3. Battiti, R., Brunato, M., and Mascia, F. Reactive Search and Intelligent Optimization. Operations Research/Computer Science Interfaces Series, Vol. 45. Springer, 2008.
4. Birattari, M., Yuan, Z., Balaprakash, P., and Stützle, T. F-Race and Iterated F-Race: An overview. In Experimental Methods for the Analysis of Optimization Algorithms. Springer-Verlag, Berlin/Heidelberg, 2010, 311-336.
5. Carchrae, T. and Beck, J. Applying machine learning to low knowledge control of optimization algorithms. Computational Intelligence 21, 4 (Nov. 2005), 373-387.
6. Cheeseman, P., Kanefsky, B., and Taylor, W.M. Where the really hard problems are. In Proceedings of the 12th International Joint Conference on Artificial Intelligence. Morgan Kaufmann, San Mateo, CA, 1991, 331-337.
7. Da Costa, L., Fialho, Á., Schoenauer, M., and Sebag, M. Adaptive operator selection with dynamic multi-armed bandits. In Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation. ACM Press, New York, 2008, 913-920.
8. Diao, Y., Eskesen, F., Froehlich, S., Hellerstein, J.L., Spainhower, L., and Surendra, M. Generic online optimization of multiple configuration parameters with application to a database server. In Proceedings of the 14th IFIP/IEEE International Workshop on Distributed Systems: Operations and Management, Vol. 2867 LNCS. Springer-Verlag, Berlin/Heidelberg, 2003, 3-15.
9. Gagliolo, M. and Schmidhuber, J. Dynamic algorithm portfolios. In Proceedings of the Ninth International Symposium on Artificial Intelligence and Mathematics; http://anytime.cs.umass.edu/aimath06/
10. Gomes, C.P. and Selman, B. Algorithm portfolios. Artificial Intelligence 126, 1-2 (Feb. 2001), 43-62. (Pubitemid 32196231)
11. Guerri, A. and Milano, M. Learning techniques for automatic algorithm portfolio selection. In Proceedings of the 16th European Conference on Artificial Intelligence. IOS Press, Amsterdam, 2004, 475-479.
12. Hamerly, G. and Elkan, C. Learning the k in k-means. In Proceedings of the Conference on Advances in Neural Information Processing Systems. MIT Press, Cambridge, MA, 2004, 281-288.
13. Hoos, H.H. Automated algorithm configuration and parameter tuning. In Autonomous Search, Y. Hamadi and F. Saubion, Eds. Springer-Verlag, 2011.
14. Hoos, H. Programming by Optimisation. Technical Report TR-2010-14. Department of Computer Science, University of British Columbia, Vancouver, 2010.
15. Hoos, H. Computer-Aided Design of High-Performance Algorithms. Technical Report TR 2008-16. Department of Computer Science, University of British Columbia, Vancouver, 2008.
16. Hoos, H.H. and Stützle, T. Stochastic Local Search: Foundations and Applications. Morgan Kaufmann Publishers, San Francisco, 2004.
17. Huberman, B., Lukose, R., and Hogg, T. An economics approach to hard computational problems. Science 275, 5296 (Jan. 1997), 51-54. (Pubitemid 27020302)
18. Hutter, F., Babić, D., Hoos, H.H., and Hu, A.J. Boosting verification by automatic tuning of decision procedures. In Proceedings of Formal Methods in Computer-Aided Design. IE Computer Society Press, Los Alamitos, CA, 2007, 27-34.
19. Hutter, F., Hoos, H., Leyton-Brown, K., and Stützle, T. ParamILS : An automatic algorithm configuration framework. Journal of Artificial Intelligence Research 36 (Sept.-Dec. 2009), 267-306.
20. Hutter, F., Hoos, H., and Stützle, T. Automatic algorithm configuration based on local search. In Proceedings of the 22nd National Conference on Artificial Intelligence. AAI Press, Palo Alto, CA, 2007, 1152-1157. (Pubitemid 350149724)
21. Hutter, F., Hoos, H.H., and Leyton-Brown, K. Automated configuration of mixed integer programming solvers. In Proceedings of the Seventh International Conference on the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, Vol. 6140 LNCS. Springer-Verlag, Berlin/Heidelberg, 2010, 186-202.
22. Hutter, F., Hoos, H.H., and Leyton-Brown, K. Sequential model-based optimization for general algorithm configuration. In Proceedings of the Fifth International Conference on Learning and Intelligent Optimization, Vol. 6683 LNCS. Springer-Verlag, Berlin/Heidelberg, 2011, 507-523.
23. Kadioglu, S., Malitsky, Y., Sellmann, M., and Tierney, K. ISAC : An instance-specific algorithm configuration. In Proceedings of the 19th European Conference on Artificial Intelligence. IOS Press, Amsterdam, 2010, 751-756.
24. KhudaBukhsh, A., Xu, L., Hoos, H., and Leyton-Brown, K. SAT enstein: Automatically building local search SAT solvers from components. In Proceedings of the 21st International Joint Conference on Artificial Intelligence. AAAI Press, Palo Alto, CA , 2009, 517-524.
25. Leyton-Brown, K., Nudelman, E., Andrew, G., McFadden, J., and Shoham, Y. A portfolio approach to algorithm selection. In Proceedings of the 18th International Joint Conference on Artificial Intelligence. Morgan Kaufmann Publishers, San Francisco, 1542-1543.
26. Li, X., Garzarn, M.J., and Padua, D. Optimizing sorting with genetic algorithms. In Proceedings of the International Symposium on Code Generation and Optimization. IE Computer Society Press, Washington, D.C., 2005, 99-110. (Pubitemid 43773796)
27. Maron, O. and Moore, A.W. Hoeffding races: Accelerating model selection search for classification and function approximation. In Proceedings of the Seventh Conference on Advances in Neural Information Processing Systems. Morgan Kaufmann Publishers, San Francisco, 1994, 59-66.
28. Monette, J.N., Deville, Y., and Hentenryck, P.V. Aeon: Synthesizing scheduling algorithms from high-level models. Operations Research and Cyber-Infrastructure Series, Vol. 47. Springer Science+Business, New York, 2009, 43-59.
29. Nell, C.W., Fawcett, C., Hoos, H.H., and Leyton-Brown, K. HAL: A framework for the automated design and analysis of high-performance algorithms. In Proceedings of the Fifth International Conference on Learning and Intelligent Optimization, Vol. 6683 LNCS. Springer-Verlag, Berlin/Heidelberg, 2011, 600-615.
30. Nudelman, E., Leyton-Brown, K., Devkar, A., Shoham, Y., and Hoos, H.H. Understanding random SAT : Beyond the clauses-to-variables ratio. In Principles and Practice of Constraint Programming, Vol. 3258 LNCS. Springer-Verlag, Berlin/Heidelberg, 2004, 438-452.
31. Pan, Z. and Eigenmann, R. Fast and effective orchestration of compiler optimizations for automatic performance tuning. In Proceedings of the International Symposium on Code Generation and Optimization. IE Computer Society Press, Washington, D.C., 2006, 319-332.
32. Rice, J.R. The algorithm selection problem. Advances in Computers 15 (1976), 65-118.
33. Sanders, P. and Schultes, D. Engineering fast route planning algorithms. In Proceedings of the Sixth International Workshop on Experimental Algorithms, Vol. 4525 LNCS. Springer-Verlag, Berlin/Heidelberg, 2007, 23-36. (Pubitemid 350259657)
34. Spall, J. Introduction to Stochastic Search and Optimization. John Wiley & Sons, Inc., New York, 2003.
35. Vallati, M., Fawcett, C., Gerevini, A., Hoos, H.H., and Saetti, A. Automatic generation of efficient domainoptimized planners from generic parametrized planners. In Proceedings of the Eighth RCRA International Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion, 2011; http://ijcai-11.iiia.csic.es/files/proceedings/RCRA2011- proceedings.pdf
36. Vilalta, R. and Drissi, Y. A perspective view and survey of meta-learning. Artificial Intelligence Review 18, 2 (Oct. 2002), 77-95.
37. Westfold, S.J. and Smith, D.R. Synthesis of efficient constraint-satisfaction programs. Knowledge Engineering Review 16, 1 (Mar. 2001), 69-84. (Pubitemid 33691670)
38. Whaley, R.C., Petitet, A., and Dongarra, J.J. Automated empirical optimizations of software and the ATLAS project. Parallel Computing 27, 1-2 (Jan. 2001), 3-35. (Pubitemid 32264775)
39. Xu, L., Hoos, H., and Leyton-Brown, K. Hydra: Automatically configuring algorithms for portfoliobased selection. In Proceedings of the 24th AAAI Conference on Artificial Intelligence. AAI Press, Palo Alto, CA, 2010, 210-216.
40. Xu, L., Hutter, F., Hoos, H.H., and Leyton-Brown, K. SAT zilla: Portfolio-based algorithm selection for SAT. Journal of Artificial Intelligence Research 32 (May- Aug. 2008), 565-606.