bsilverthorn's profile

Recent Activity

• 22:28: posted {An Introduction to Variable and Feature Selection}
• 03:35: posted {ParamILS: An Automatic Algorithm Configuration Framework}

• 23:58: posted {FPGA Routing and Routability Estimation Via Boolean Satisfiability}
• 23:53: posted {Fault Diagnosis and Logic Debugging Using Boolean Satisfiability}
• 22:39: posted {Symbolic Model Checking using SAT procedures instead of BDDs}
• 04:19: posted {GRASP: A Search Algorithm for Propositional Satisfiability}
• 03:41: posted Reading Tea Leaves: How Humans Interpret Topic Models

• 16:52: posted Binary Action Search for Learning Continuous-Action Control Policies

• 01:52: posted {Problem Structure in the Presence of Perturbations}

• 16:40: posted {Non-Parametric Bayesian Dictionary Learning for Sparse Image Representations}

• 20:42: posted {Noise Strategies for Improving Local Search}
• 20:40: posted {Random Walk With Continuously Smoothed Variable Weights}
• 20:30: posted {Algorithms for the Maximum Satisfiability Problem}
• 20:21: posted {Scaling and Probabilistic Smoothing: Efficient Dynamic Local Search for SAT}
• 20:17: posted {Warped Landscapes and Random Acts of SAT Solving}
• 20:13: posted {Robust taboo search for the quadratic assignment problem}
• 20:10: posted {Additive versus Multiplicative Clause Weighting for SAT}
• 20:05: posted {On the Run-time Behaviour of Stochastic Local Search Algorithms for SAT}
• 20:03: posted {Evidence for Invariants in Local Search}
• 20:01: posted {Iterated Robust Tabu Search for MAX-SAT}
• 19:58: posted {Unsatisfied Variables in Local Search}
• 19:52: posted {Towards an Understanding of Hill-climbing Procedures for SAT}
• 18:29: posted {Domain-Independent Extensions to GSAT: Solving Large Structured Variables}
• 18:19: posted {Tabu Search for SAT}
• 18:16: posted {A New Method for Solving Hard Satisfiability Problems}
• 18:11: posted Diversification and Determinism in Local Search for Satisfiability
• 18:07: posted {On the Quality and Quantity of Random Decisions in Stochastic Local Search for SAT}
• 18:04: posted {Neighbourhood Clause Weight Redistribution in Local Search for SAT}
• 17:57: posted {A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems}
• 17:54: posted {On Selecting a Satisfying Truth Assignment}
• 17:51: posted {An Adaptive Noise Mechanism for WalkSAT}
• 17:38: posted {Combining Adaptive Noise and Look-Ahead in Local Search for SAT}
• 03:44: posted {Optimal Speedup of Las Vegas Algorithms}

• 01:58: posted {Optimal Statistical Decisions}

• 20:17: posted {A Note on the Implementation of Hierarchical Dirichlet Processes}
• 20:10: posted {Interpolating Between Types and Tokens by Estimating Power-Law Generators}
• 18:41: posted {A Fast Elitist Non-Dominated Sorting Genetic Algorithm for Multi-Objective Optimization: NSGA-II}

• 00:11: posted {Learning to Select Branching Rules in the DPLL Procedure for Satisfiability}
• 00:09: posted Statistical Models for Empirical Search-Based Performance Tuning

• 22:21: posted {Application of a Simple Nonparametric Conditional Quantile Function Estimator in Unemployment Duration Analysis}
• 17:31: posted {Towards Distributed Algorithm Portfolios}