Quantifying Homogeneity of Instance Sets for Algorithm Configuration

No abstract is available for this paper.

• Publication year

  2012

• Venue

  Learning and Intelligent Optimization

• Publication date

  2012-01-16

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/978-3-642-34413-8_14
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Pattern Recognition And Machine Learning

  2016cited by this paper
• Instance-Specific Algorithm Configuration

  2014cited by this paper
• ParamILS: An Automatic Algorithm Configuration Framework

  2014influential reference
• Programming by optimization

  2012cited by this paper
• A Portfolio Solver for Answer Set Programming: Preliminary Report

  2011cited by this paper
• Theory and Applications of Satisfiability Testing - SAT 2011 - 14th International Conference, SAT 2011, Ann Arbor, MI, USA, June 19-22, 2011. Proceedings

  2011cited by this paper
• Captain Jack: New Variable Selection Heuristics in Local Search for SAT

  2011cited by this paper
• Logic Programming and Nonmonotonic Reasoning

  2011cited by this paper
• Algorithm Selection and Scheduling

  2011cited by this paper
• Sequential Model-Based Optimization for General Algorithm Configuration

  2011cited by this paper
• Instance-Based Parameter Tuning via Search Trajectory Similarity Clustering

  2011cited by this paper
• Generating Fast Domain-Specific Planners by Automatically Configuring a Generic Parameterised Planner

  2011cited by this paper
• Models and Strategies for Variants of the Job Shop Scheduling Problem

  2011cited by this paper
• A Preliminary Evaluation of Machine Learning in Algorithm Selection for Search Problems

  2011cited by this paper
• Tradeoffs in the empirical evaluation of competing algorithm designs

  2010influential reference
• Hydra: Automatically Configuring Algorithms for Portfolio-Based Selection

  2010cited by this paper
• Automated Configuration of Mixed Integer Programming Solvers

  2010cited by this paper
• Programming by Optimisation

  2010cited by this paper
• ISAC - Instance-Specific Algorithm Configuration

  2010influential reference
• Data fusion

  2009cited by this paper
• Relaxed Survey Propagation for The Weighted Maximum Satisfiability Problem

  2009cited by this paper
• Synthesizing Filtering Algorithms for Global Chance-Constraints

  2009cited by this paper
• SATenstein: Automatically Building Local Search SAT Solvers from Components

  2009cited by this paper
• Empirical hardness models: Methodology and a case study on combinatorial auctions

  2009cited by this paper
• Cross-disciplinary perspectives on meta-learning for algorithm selection

  2009cited by this paper
• A Gender-Based Genetic Algorithm for the Automatic Configuration of Algorithms

  2009cited by this paper
• ManySAT: a Parallel SAT Solver

  2009cited by this paper
• SATzilla: Portfolio-based Algorithm Selection for SAT

  2008influential reference
• Automatic Algorithm Configuration Based on Local Search

  2007cited by this paper
• Hierarchical Hardness Models for SAT

  2007cited by this paper
• Conflict-Driven Answer Set Solving

  2007cited by this paper
• Boosting Verification by Automatic Tuning of Decision Procedures

  2007cited by this paper
• Combining Multiple Heuristics Online

  2007cited by this paper
• 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

  2007cited by this paper
• Principles and Practice of Constraint Programming - CP 2007, 13th International Conference, CP 2007, Providence, RI, USA, September 23-27, 2007, Proceedings

  2007cited by this paper
• Pattern Recognition and Machine Learning

  2006cited by this paper
• Principles and Practice of Constraint Programming - CP 2006, 12th International Conference, CP 2006, Nantes, France, September 25-29, 2006, Proceedings

  2006cited by this paper
• Performance Prediction and Automated Tuning of Randomized and Parametric Algorithms

  2006cited by this paper
• Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations

  2005cited by this paper
• Benchmarking SAT Solvers for Bounded Model Checking

  2005cited by this paper
• Learning Techniques for Automatic Algorithm Portfolio Selection

  2004cited by this paper
• Knowledge Representation, Reasoning and Declarative Problem Solving

  2003cited by this paper
• Learning the k in k-means

  2003cited by this paper
• A Racing Algorithm for Configuring Metaheuristics

  2002cited by this paper
• Algorithm portfolios

  2001cited by this paper
• Variable-Selection Heuristics in Local Search for SAT

  1997cited by this paper
• An algorithm for the selection problem

  1986cited by this paper
• Some methods for classification and analysis of multivariate observations

  1967influential reference
• Some methods for classi cation and analysis of multivariate observations

  1967cited by this paper
• Hierarchical Grouping to Optimize an Objective Function

  1963cited by this paper
• Mathematical Statistics and Probability

  1962cited by this paper

• SynthACticBench: A Capability-Based Synthetic Benchmark for Algorithm Configuration

  2025cites this paper
• Competitions in AI - Robustly Ranking Solvers Using Statistical Resampling

  2023cites this paper
• A Framework for Generating Informative Benchmark Instances

  2022cites this paper
• Heterogeneous Heuristic Optimisation and Scheduling for First-Order Theorem Proving

  2021cites this paper
• Extreme Algorithm Selection With Dyadic Feature Representation

  2020cites this paper
• Dynamic Algorithm Configuration: Foundation of a New Meta-Algorithmic Framework

  2020cites this paper
• Candidate Selection and Instance Ordering for Realtime Algorithm Configuration

  2019cites this paper
• Towards White-box Benchmarks for Algorithm Control

  2019cites this paper
• CAVE: Configuration Assessment, Visualization and Evaluation

  2018cites this paper
• Selection and Configuration of Parallel Portfolios

  2018cites this paper
• Efficient Benchmarking of Algorithm Configuration Procedures via Model-Based Surrogates

  2017cites this paper
• Report from Dagstuhl Seminar 16412 Automated Algorithm Selection and Configuration

  2017cites this paper
• Chapter 8 Selection and Configuration of Parallel Portfolios

  2017cites this paper
• Pitfalls and Best Practices in Algorithm Configuration

  2017cites this paper
• Automated Algorithm Selection and Configuration (Dagstuhl Seminar 16412)

  2016cites this paper
• The irace package: Iterated racing for automatic algorithm configuration

  2016cites this paper
• Enhanced structure determination from powder diffraction data via algorithm optimisation and the use of conformational information

  2016cites this paper
• Terms of use : Click here aspeed : Solver scheduling via answer set programming

  2014cites this paper
• aspeed: Solver scheduling via answer set programming 1

  2014cites this paper
• An Analysis of Parameters of irace

  2014cites this paper
• Under consideration for publication in Theory and Practice of Logic Programming 1 aspeed : Solver Scheduling via Answer Set Programming ∗

  2014cites this paper
• Bandit-Based Search for Constraint Programming

  2013cites this paper
• Automated Parameter Tuning Framework for Heterogeneous and Large Instances: Case Study in Quadratic Assignment Problem

  2013cites this paper
• Algorithm Configuration for Portfolio-based Parallel SAT-Solving

  2012cites this paper
• aspeed: ASP-based Solver Scheduling

  2012cites this paper