- A Simple Distribution-Free Approach to the Max k-Armed Bandit Problem
- Learning Dynamic Algorithm Portfolios Matteo Gagliolo Jurgen Schmidhuber
- Technical Reports on Mathematical and Computing Sciences: TR-C146 title: An Improved Randomized Algorithm for 3-SAT
- On the Potential of Automatic Algorithm Configuration
- Boosting Verification by Automatic Tuning of Decision Procedures
- SAT COMPETITION 2007 -SOLVER DESCRIPTION Scaling and Probabilistic Smoothing (SAPS)
- Performance Prediction and Automated Tuning of Randomized and Parametric Algorithms: An Initial Investigation
- Efficient Stochastic Local Search for MPE Solving Frank Hutter
- Stochastic Local Search for Solving the
- Efficient On-line Fault Diagnosis for Non-Linear Systems Frank Hutter
- Sequential Model-Based Optimization for General Algorithm Configuration
- Time-Bounded Sequential Parameter Optimization
- Journal of Artificial Intelligence Research 36 (2009) 267-306 Submitted 06/09; published 10/09 ParamILS: An Automatic Algorithm Configuration Framework
- PARAMILS: AN AUTOMATIC ALGORITHM CONFIGURATION FRAMEWORK ParamILS: An Automatic Algorithm Configuration Framework
- Journal of Artificial Intelligence Research 32 (2008) 565-606 Submitted 11/07; published 06/08 SATzilla: Portfolio-based Algorithm Selection for SAT
- SATzilla-07: The Design and Analysis of an Algorithm Portfolio for SAT
- Parameter Adjustment Based on Performance Prediction: Towards an Instance-Aware Problem Solver
- Incremental Thin Junction Trees for Dynamic Bayesian networks
- A New Algorithm for RNA Secondary Structure Design
- UBC Exam Timetabling Chris Fawcett
- Dynamically dimensioned search algorithm for computationally efficient watershed model calibration
- Computational Analysis of Perfect-Information Position David Robert Martin Thompson
- AEON: Synthesizing Scheduling Algorithms from High-Level Models
- A Modular Multiphase Heuristic Solver for Post Enrolment
- Algorithms for Pure Nash Equilibria in Weighted Congestion Games
- Algorithms for Pure Nash Equilibria in Weighted
- Advances in Local Search for Satisfiability Duc Nghia Pham, John Thornton, Charles Gretton, and Abdul Sattar
- Adaptive Operator Selection with Dynamic Multi-Armed Bandits
- A Modular Multiphase Heuristic Solver for Post Enrolment Course Timetabling
- Experiments on Metaheuristics: Methodological Overview and Open Issues
- Testing Heuristics: We Have It All Wrong J. N. Hooker
- Recovering and Exploiting Structural Knowledge from CNF Formulas
- IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, VOL. 1, NO. 1, APRIL 1997 67 No Free Lunch Theorems for Optimization
- Journal of Global Optimization 21: 345383, 2001. 2001 Kluwer Academic Publishers. Printed in the Netherlands.
- Contract no: IESBS20851A2/1/085 Experimental Design: A Bayesian Perspective
- Estimating Search Tree Size Philip Kilby
- Building Structure into Local Search for SAT Duc Nghia Pham1,2
- Multi-Agent Algorithms for Solving Graphical Games David Vickrey
- Search Space Features Underlying the Performance of Stochastic Local Search Algorithms for MAX-SAT
- Ant Algorithms for Discrete Optimization
- Complete Local Search for Propositional Satisfiability Department of Computer Science
- The Traveling Salesman Problem: A Case Study in Local Optimization
- arXiv:cs.CC/0205064v39Sep2002 A polynomial time (heuristic) SAT algorithm 2002 Charles Sauerbier All rights reserved.
- PDMI PREPRINT --14/1998 APPROXIMATION ALGORITHMS FOR MAX SAT: A
- A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Uwe Schoning
- Satisfiability Coding Lemma Ramamohan Paturi
- Accelerating Random Walks Wei Wei and Bart Selman
- Understanding Random SAT: Beyond the Clauses-to-Variables Ratio
- Random 3-SAT: The Plot Thickens CRISTIAN COARFA
- Doing a PhD in AI: a Case Study Frank Hutter
- Bayesian CART Prior Specification and Posterior Simulation
- Disco Novo GoGo Integrating Local Search and Complete Search with Restarts
- Learning to Select Branching Rules in the DPLL Procedure for Satisfiability Michail G. Lagoudakis MGL@CS.DUKE.EDU
- Simple Search Methods for Finding a Nash Equilibrium Ryan Porter and Eugene Nudelman and Yoav Shoham
- RESOURCE ALLOCATION IN COMPETITIVE MULTIAGENT SYSTEMS
- Fractional Factorial Experiments Statistical Design and Analysis of Experiments p.1/14
- arXiv:0811.2546v1[cs.DS]16Nov2008 Phase transition for Local Search on planted SAT
- SPEAR Theorem Prover Domagoj Babic
- Backdoors To Typical Case Complexity Ryan Williams
- Random 3-SAT and BDDs: The Plot Thickens Further
- ! " # $ # % & ' ( ) 0 1 2 3 4 5 6 7 8 9 @ A B C D E F G H I P F Q
- Experiments on Metaheuristics: Methodological Overview
- Artificial Intelligence 136 (2002) 101144 www.elsevier.com/locate/artint
- SATzilla2009: an Automatic Algorithm Portfolio for SAT Lin Xu, Frank Hutter, Holger H. Hoos and Kevin Leyton-Brown
- MachineLearning, 14, 333-347 (1994) 1994KluwerAcademicPublishers,Boston. Manufacturedin The Netherlands.
- Understanding Random SAT: Beyond the Clauses-to-Variables Ratio
- Sequential Model-Based Optimization for General Algorithm Configuration
- Automated Configuration of Algorithms for Solving Hard Computational Problems
- Towards Industrial-Like Random SAT Instances Carlos Ansotegui
- Control Abstractions for Local Search Pascal Van Hentenryck and Laurent Michel
- Impact of censored sampling on the performance of restart strategies
- Many combinatorial optimization algorithms have no mechanism for capturing inter-parameter
- Computing Nash Equilibria of Action-Graph Games Navin A. R. Bhat
- Machine Learning for Sequential Data: A Review Thomas G. Dietterich
- An Improved Exponential-time Algorithm for Ramamohan Paturi , Pavel Pudlak,
- An Experimental Study of a Parallel Shortest Path Algorithm for Solving Large-Scale Graph Instances
- Tuning Search Algorithms for Real-World Applications
- The Quest for Efficient Boolean Satisfiability Solvers Lintao Zhang, Sharad Malik
- THE GAUSSIAN PARTICLE FILTER FOR DIAGNOSIS OF NON-LINEAR SYSTEMS
- Analysis of balanced, completely randomized designs. constant vs random effects
- Chaff: Engineering an Efficient SAT Solver Matthew W. Moskewicz
- 13 May 1983, Volume 220, Number 4598 Optimization by
- Efficient Statistical Methods for Evaluating Trading Agent Performance Eric Sodomka, John Collins, and Maria Gini
- arXiv:0807.1494v1[cs.AI]9Jul2008 Algorithm Selection as a Bandit Problem with Unbounded
- PARAMETER TUNING BY SIMPLE REGRET ALGORITHMS AND MULTIPLE SIMULTANEOUS HYPOTHESIS TESTING
- Game-SAT: A Preliminary Report Ling Zhao and Martin Muller
- SATzilla2007: a New & Improved Algorithm Portfolio for SAT Lin Xu, Frank Hutter, Holger H. Hoos and Kevin Leyton-Brown
- Universit Libre de Bruxelles Institut de Recherches Interdisciplinaires
- Performance Analysis of Online Anticipatory Algorithms for Large Multistage Stochastic Integer Programs
- Journal of Heuristics, 7: 7797 (2000) c 2001 Kluwer Academic Publishers
- Learning Restart Strategies Matteo Gagliolo
- Instance-Based Selection of Policies for SAT Mladen Nikolic, Filip Maric, Predrag Janicic
- Hydra-MIP: Automated Algorithm Configuration and Selection for Mixed Integer Programming
- Parallel Algorithm Configuration Frank Hutter, Holger H. Hoos and Kevin Leyton-Brown
