Sequential Model-Based Optimization for General Algorithm Configuration
暂无分享,去创建一个
[1] Gerald DeJong,et al. COMPOSER: A Probabilistic Solution to the Utility Problem in Speed-Up Learning , 1992, AAAI.
[2] Steven Minton,et al. Minimizing Conflicts: A Heuristic Repair Method for Constraint Satisfaction and Scheduling Problems , 1992, Artif. Intell..
[3] Bart Selman,et al. Problem Structure in the Presence of Perturbations , 1997, AAAI/IAAI.
[4] Donald R. Jones,et al. Efficient Global Optimization of Expensive Black-Box Functions , 1998, J. Glob. Optim..
[5] Toby Walsh,et al. Morphing: Combining Structure and Randomness , 1999, AAAI/IAAI.
[6] Yoav Shoham,et al. Towards a universal test suite for combinatorial auction algorithms , 2000, EC '00.
[7] Thomas J. Santner,et al. Sequential design of computer experiments to minimize integrated response functions , 2000 .
[8] George C. Runger,et al. Using Experimental Design to Find Effective Parameter Settings for Heuristics , 2001, J. Heuristics.
[9] Trevor Hastie,et al. The Elements of Statistical Learning , 2001 .
[10] Holger H. Hoos,et al. Scaling and Probabilistic Smoothing: Efficient Dynamic Local Search for SAT , 2002, CP.
[11] Yoav Shoham,et al. Learning the Empirical Hardness of Optimization Problems: The Case of Combinatorial Auctions , 2002, CP.
[12] Thomas Stützle,et al. A Racing Algorithm for Configuring Metaheuristics , 2002, GECCO.
[13] Alper Atamtürk,et al. On the facets of the mixed–integer knapsack polyhedron , 2003, Math. Program..
[14] Nello Cristianini,et al. Kernel Methods for Pattern Analysis , 2003, ICTAI.
[15] Leo Breiman,et al. Random Forests , 2001, Machine Learning.
[16] Holger H. Hoos,et al. UBCSAT: An Implementation and Experimentation Environment for SLS Algorithms for SAT & MAX-SAT , 2004, SAT.
[17] Thomas Bartz-Beielstein,et al. Tuning search algorithms for real-world applications: a regression tree based approach , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).
[18] Yoav Shoham,et al. Understanding Random SAT: Beyond the Clauses-to-Variables Ratio , 2004, CP.
[19] Thomas Bartz-Beielstein,et al. Sequential parameter optimization , 2005, 2005 IEEE Congress on Evolutionary Computation.
[20] Emmanuel Zarpas,et al. Benchmarking SAT Solvers for Bounded Model Checking , 2005, SAT.
[21] Julia Couto. Kernel K-Means for Categorical Data , 2005, IDA.
[22] N. Zheng,et al. Global Optimization of Stochastic Black-Box Systems via Sequential Kriging Meta-Models , 2006, J. Glob. Optim..
[23] Thomas Bartz-Beielstein,et al. Experimental Research in Evolutionary Computation - The New Experimentalism , 2010, Natural Computing Series.
[24] Manuel Laguna,et al. Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search , 2006, Oper. Res..
[25] Alan J. Hu,et al. Boosting Verification by Automatic Tuning of Decision Procedures , 2007, Formal Methods in Computer Aided Design (FMCAD'07).
[26] Laurence A. Wolsey,et al. Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 4th International Conference, CPAIOR 2007, Brussels, Belgium, May 23-26, 2007, Proceedings , 2007, CPAIOR.
[27] Alan J. Hu,et al. Structural Abstraction of Software Verification Conditions , 2007, CAV.
[28] Thomas Stützle,et al. Improvement Strategies for the F-Race Algorithm: Sampling Design and Iterative Refinement , 2007, Hybrid Metaheuristics.
[29] M. Baz,et al. Automated Tuning of Optimization Software Parameters , 2007 .
[30] Thomas Stützle,et al. Automatic Algorithm Configuration Based on Local Search , 2007, AAAI.
[31] Kevin Leyton-Brown,et al. SATzilla2009: an Automatic Algorithm Portfolio for SAT , 2008 .
[32] Kevin Leyton-Brown,et al. SATzilla: Portfolio-based Algorithm Selection for SAT , 2008, J. Artif. Intell. Res..
[33] Babić Domagoj,et al. Exploiting structure for scalable software verification , 2008 .
[34] Frank Hutter,et al. Automated configuration of algorithms for solving hard computational problems , 2009 .
[35] F. Hutter,et al. ParamILS: An Automatic Algorithm Configuration Framework , 2009, J. Artif. Intell. Res..
[36] Yoav Shoham,et al. Empirical hardness models: Methodology and a case study on combinatorial auctions , 2009, JACM.
[37] Roberto Rossi,et al. Synthesizing Filtering Algorithms for Global Chance-Constraints , 2009, CP.
[38] Kevin Leyton-Brown,et al. SATenstein: Automatically Building Local Search SAT Solvers from Components , 2009, IJCAI.
[39] Kousha Etessami,et al. Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations , 2005, JACM.
[40] Carl E. Rasmussen,et al. Gaussian processes for machine learning , 2005, Adaptive computation and machine learning.
[41] Carlos Ansótegui,et al. A Gender-Based Genetic Algorithm for the Automatic Configuration of Algorithms , 2009, CP.
[42] Kevin P. Murphy,et al. An experimental investigation of model-based parameter optimisation: SPO and beyond , 2009, GECCO.
[43] Thomas Stützle,et al. F-Race and Iterated F-Race: An Overview , 2010, Experimental Methods for the Analysis of Optimization Algorithms.
[44] Kevin P. Murphy,et al. Time-Bounded Sequential Parameter Optimization , 2010, LION.
[45] Kevin Leyton-Brown,et al. Automated Configuration of Mixed Integer Programming Solvers , 2010, CPAIOR.
[46] Kevin Leyton-Brown,et al. HAL: A Framework for the Automated Analysis and Design of High-Performance Algorithms , 2011, LION.