- Annals of Mathematics and Artificial Intelligence manuscript No. (will be inserted by the editor)
- Propositional SAT Algorithms and their Application to Solving
- 2ND INTERNATIONAL CONFERENCE ON METAHEURISTICS MIC97 1 MAX --MIN Ant System and Local Search for
- An Ant Colony Optimization Algorithm for the 2D HP Protein Folding Problem
- Characterizing the Runtime Behavior of Stochastic Local
- Hierarchical Hardness Models for SAT Lin Xu, Holger H. Hoos, and Kevin Leyton-Brown
- An Adaptive Noise Mechanism for WalkSAT Holger H. Hoos
- Characterising and Improving SLS Behaviour
- SAT-Encodings, Search Space Structure, and Local Search Performance
- Stochastic Local Search Methods for Dynamic SAT ---an Initial Investigation
- An HTTP Interface to Salieri Kai Renz and Holger H. Hoos
- Towards a Characterisation of the Behaviour of Stochastic Local Search Algorithms for SAT
- Dynamic Scoring Functions with Variable Expressions: New SLS Methods for Solving SAT
- SATzilla-07: The Design and Analysis of an Algorithm Portfolio for SAT
- A Parallel Workflow for Real-time Correlation and Clustering of High-Frequency Stock Market Data
- MIC2005. The 6th Metaheuristics International Conference 361 An Analysis of the Hardness of TSP Instances for Two
- UBCSAT: An Implementation and Experimentation Environment for SLS Algorithms for SAT and MAX-SAT
- Hybrid Randomised Neighbourhoods Improve Stochastic Local Search for DNA Code Design
- From RNA Secondary Structure to Coding Theory: A Combinatorial Approach
- An Adaptive Noise Mechanism for WalkSAT Holger H. Hoos
- An Adaptive Noise Mechanism for WalkSAT Holger H. Hoos
- GUIDO/MIR --an Experimental Musical Information Retrieval System
- Local Search Algorithms for SAT: An Empirical Evaluation Holger H. Hoos (hoos@cs.ubc.ca)
- Solving Combinatorial Auctions using Stochastic Local Search Holger H. Hoos
- Stochastic Local Search Methods for Dynamic SAT --an Initial Investigation
- Using Advanced GUIDO as a Notation Interchange Format Holger H. Hoos
- On the Run-time Behaviour of Stochastic Local Search Algorithms for SAT Holger H. Hoos
- Hoe ding Races: Accelerating Model Selection Search for Classi cation and
- Narayana's Cows Compositional Study #1 Holger H. Hoos (1996)
- SATLIB: An Online Resource for Research on SAT Holger H. Hoos (hoos@cs.ubc.ca)
- Bidding Languages for Combinatorial Auctions Craig Boutilier
- Scaling and Probabilistic Smoothing: Efficient Dynamic Local Search for SAT
- Warped Landscapes and Random Acts of SAT Solving Dave A. D. Tompkins and Holger H. Hoos
- Time-Bounded Sequential Parameter Optimization
- LPSP --A linear planlevel stochastic planner Ronen I. Brafman
- A Mixture-Model for the Behaviour of SLS Algorithms for SAT Holger H. Hoos
- Evaluating Las Vegas Algorithms ---Pitfalls and Remedies
- A General, Interactive Computer Music System Holger H. Hoos, Jurgen Kilian, Kai Renz, and Thomas Helbich
- Stochastic Local Search for Multiprocessor Scheduling for Minimum Total Tardiness
- A WEB-based Approach to Music Notation using GUIDO Kai Renz and Holger H. Hoos
- A General, Interactive Computer Music System Holger H. Hoos, Jurgen Kilian, Kai Renz, and Thomas Helbich
- Bidding Languages for Combinatorial Auctions Craig Boutilier
- A WEBbased Approach to Music Notation using GUIDO Kai Renz and Holger H. Hoos
- The GUIDO Notation Format A Novel Approach for Adequately Representing ScoreLevel Music
- Scaling and Probabilistic Smoothing: Ecient Dynamic Local Search for SAT
- Systematic vs. Local Search for SAT Holger H. Hoos 1 and Thomas Stutzle 2
- Local Search Algorithms for SAT: An Empirical Evaluation Holger H. Hoos (hoos@cs.ubc.ca)
- University of British Columbia Department of Computer Science
- Stochastic Local Search Algorithms for DNA Word Design
- Reasoning With Conditional Ceteris Paribus Preference Statements Craig Boutilier
- Performance Prediction and Automated Tuning of Randomized and Parametric Algorithms
- Morphing: Combining Structure and Randomness Ian P. Gent
- Improving the Ant System: A Detailed Report on the MAX --MIN Ant System
- MAX --MIN Ant System Thomas St utzle 1
- On the Empirical Evaluation of Las Vegas Algorithms
- GSAT versus Simulated Annealing A. Beringer 1
- Some Surprising Regularities in the Behaviour of Stochastic Local Search
- Using Stochastic Local Search to Solve Quantified Boolean Formulae
- To Encode or not to Encode --I: Linear Planning Ronen I. Brafman
- MAX --MIN Ant System and Local Search for the Traveling Salesman Problem
- Dynamic Scoring Functions with Variable Expressions: New SLS Methods for Solving SAT
- Systematic vs. Local Search for SAT Holger H. Hoos
- On the Runtime Behaviour of Stochastic Local Search Algorithms for SAT Holger H. Hoos
- SLS Algorithms for SAT In this chapter, we give an overview of some of the most relevant SLS algorithms for SAT and
- Solving Combinatorial Auctions using Stochastic Local Search Holger H. Hoos
- Automated Configuration of Mixed Integer Programming Solvers
- Drops Compositional Study #2 Holger H. Hoos (1996)
- Boosting Verification by Automatic Tuning of Decision Procedures
- On the Quality and Quantity of Random Decisions in Stochastic Local Search for SAT
- SATEncodings, Search Space Structure, and Local Search Performance
- Voice Separation -A Local Optimisation Approach Voice Separation --A Local Optimisation Approach
- A Characterization of GSAT's Performance on a Class of
- Today, stochastic local search (SLS) algorithms belong to the standard methods for solving hard combinatorial problems from various areas of Artificial Intelligence (AI) and Opera
- On the Empirical Evaluation of Las Vegas Algorithms
- An Improved Ant Colony Optimisation Algorithm for the 2D HP Protein Folding Problem
- Iterated Robust Tabu Search for MAX-SAT Kevin Smyth1
- Empirical Analysis of Las Vegas Algorithms
- In this thesis we have studied various aspects of stochastic local search (SLS), an algorithmic paradigm for solving hard combinatorial problems which has become increasingly popular in
- SATLIB: An Online Resource for Research on SAT Holger H. Hoos (hoos@cs.ubc.ca)
- Ant System Thomas Stutzle
- Sequential Model-Based Parameter Optimization: an Experimental Investigation of Automated and Interactive
- Automatic Algorithm Configuration based on Local Search Frank Hutter and Holger H. Hoos
- An Experimental Investigation of Model-Based Parameter Optimisation: SPO and Beyond
- Hydra: Automatically Configuring Algorithms for Portfolio-Based Selection
- Reasoning With Conditional Ceteris Paribus Preference Statements Craig Boutilier
- VISCO --Visual SALIERI Components Jurgen Kilian
- University of British Columbia Department of Computer Science
- Solving Hard Combinatorial Problems with GSAT --a Case Study
- Generalised Local Search In this chapter, we introduce a novel formal framework for stochastic local search algo
- To Encode or not to Encode I: Linear Planning Ronen I. Brafman
- Stochastic Local Search ---Methods, Models, Applications
- Using Advanced GUIDO as a Notation Interchange Format Holger H. Hoos
- Bibliography [ACHH93] Rajeev Alur, Costas Courcoubetis, Thomas A. Henzinger, and PeiHsin Ho.
- Search Space Analysis Stochastic local search algorithms are among the most powerful methods for solving hard
- List of Symbols / Abbreviations #S cardinality (number of elements) of set S
- Towards a Characterisation of the Behaviour of Stochastic Local Search Algorithms for SAT
- Presenting Data from Experiments in Algorithmics
- SATenstein: Automatically Building Local Search SAT Solvers From Components Ashiqur R. KhudaBukhsh, Lin Xu, Holger H. Hoos, Kevin Leyton-Brown
- Ameisenalgorithmen zur L osung kombinatorischer Optimierungsprobleme
- GSAT and Simulated Annealing ---a comparison
- Introduction: Logic, Search, and NPhard Problems
- SAT Encodings and Search Space Structure
- Morphing: Combining Structure and Randomness Ian P. Gent
- !#"$%'&(0)124365 78@95!2A@BC!D&(02A9E1EFHG@@G
- GUIDO/MIR ---an Experimental Musical Information Retrieval System
- The GUIDO Notation Format A Novel Approach for Adequately Representing Score-Level Music
- Improvements on the AntSystem: Introducing the MAX --MIN Ant System
- A MixtureModel for the Behaviour of SLS Algorithms for SAT Holger H. Hoos
- GUIDO Music Notation --Towards an Adequate Representation of Score Level Music
- Stochastic Local Search ---Methods, Models, Applications
- 9Stochastic Local Search | Methods, Models, Applications
- GUIDO Music Notation Towards an Adequate Representation of Score Level Music
- Scaling and Probabilistic Smoothing: Dynamic Local Search for Unweighted MAX-SAT
- The GSAT/SAFamiliy --Relating greedy satisifability
- An HTTP Interface to Salieri Kai Renz and Holger H. Hoos
- University of British Columbia Department of Computer Science
- FD-Autotune: Domain-Specific Configuration using Fast Downward Chris Fawcett
- Generating Fast Domain-Optimized Planners by Automatically Configuring a Generic Parameterised Planner
- HAL: A Framework for the Automated Analysis and Design of High-Performance Algorithms
- Information Processing Letters 111 (2011) 326333 Contents lists available at ScienceDirect
- University of British Columbia Department of Computer Science
- Captain Jack: New Variable Selection Heuristics in Local Search for SAT
- Automatic Generation of Efficient Domain-Optimized Planners from Generic Parametrized Planners
- Sequential Model-Based Optimization for General Algorithm Configuration
- Hydra-MIP: Automated Algorithm Configuration and Selection for Mixed Integer Programming
- Annals of Mathematics and Artificial Intelligence manuscript No. (will be inserted by the editor)
- FD-Autotune: Domain-Specific Configuration using Fast Downward Chris Fawcett
