Future paths for integer programming and links to artificial intelligence
Computers and Operations Research - Special issue: Applications of integer programming
Cooling schedules for optimal annealing
Mathematics of Operations Research
Modern heuristic techniques for combinatorial problems
Modern heuristic techniques for combinatorial problems
Noise strategies for improving local search
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Pushing the envelope: planning, propositional logic, and stochastic search
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Tuning local search for satisfiability testing
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Learning evaluation functions for global optimization and Boolean satisfiability
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
An integer local search method with application to capacitated production planning
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
On the run-time behaviour of stochastic local search algorithms for SAT
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Local search characteristics of incomplete SAT procedures
Artificial Intelligence
SAT Local Search Algorithms: Worst-Case Study
Journal of Automated Reasoning
Guided Local Search for Solving SAT and Weighted MAX-SAT Problems
Journal of Automated Reasoning
Local Search Algorithms for SAT: An Empirical Evaluation
Journal of Automated Reasoning
An algorithm based on tabu search for satisfiability problem
Journal of Computer Science and Technology
Evolutionary algorithms for the satisfiability problem
Evolutionary Computation
Phase Transitions and Stochastic Local Search in k-Term DNF Learning
ECML '02 Proceedings of the 13th European Conference on Machine Learning
Towards Provably Complete Stochastic Search Algorithms for Satisfiability
EPIA '01 Proceedings of the10th Portuguese Conference on Artificial Intelligence on Progress in Artificial Intelligence, Knowledge Extraction, Multi-agent Systems, Logic Programming and Constraint Solving
Towards Local Search for Answer Sets
ICLP '02 Proceedings of the 18th International Conference on Logic Programming
Solving Combinatorial Problems with Regular Local Search Algorithms
LPAR '99 Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning
A Two Level Local Search for MAX-SAT Problems with Hard and Soft Constraints
AI '02 Proceedings of the 15th Australian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
Using Failed Local Search for SAT as an Oracle for Tackling Harder A.I. Problems More Efficiently
AIMSA '02 Proceedings of the 10th International Conference on Artificial Intelligence: Methodology, Systems, and Applications
Multiagent SAT (MASSAT): Autonomous Pattern Search in Constrained Domains
IDEAL '02 Proceedings of the Third International Conference on Intelligent Data Engineering and Automated Learning
Handling Inconsistency Efficiently in the Incremental Construction of Statified Belief Bases
ECSQARU '95 Proceedings of the European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty
A Comparison of Systematic and Local Search Algorithms for Regular CNF Formulas
ECSQARU '95 Proceedings of the European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Solving Boolean Satisfiability Using Local Search Guided by Unit Clause Elimination
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Scaling and Probabilistic Smoothing: Efficient Dynamic Local Search for SAT
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Measuring the Spatial Dispersion of Evolutionary Search Processes: Application to Walksat
Selected Papers from the 5th European Conference on Artificial Evolution
SAT, Local Search Dynamics and Density of States
Selected Papers from the 5th European Conference on Artificial Evolution
Systematic vs. Local Search for SAT
KI '99 Proceedings of the 23rd Annual German Conference on Artificial Intelligence: Advances in Artificial Intelligence
Stochastic Local Search Algorithms for DNA Word Design
DNA8 Revised Papers from the 8th International Workshop on DNA Based Computers: DNA Computing
Solving the Satisfiability Problem through Boolean Networks
AI*IA '99 Proceedings of the 6th Congress of the Italian Association for Artificial Intelligence on Advances in Artificial Intelligence
Critical Parallelization of Local Search for MAX-SAT
AI*IA 01 Proceedings of the 7th Congress of the Italian Association for Artificial Intelligence on Advances in Artificial Intelligence
Minimal and Redundant SAT Encodings for the All-Interval-Series Problem
CCIA '02 Proceedings of the 5th Catalonian Conference on AI: Topics in Artificial Intelligence
Automated discovery of composite SAT variable-selection heuristics
Eighteenth national conference on Artificial intelligence
An adaptive noise mechanism for walkSAT
Eighteenth national conference on Artificial intelligence
A mixture-model for the behaviour of SLS algorithms for SAT
Eighteenth national conference on Artificial intelligence
Overcoming the Christmas Tree Syndrome
ICTAI '99 Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence
Contingent planning under uncertainty via stochastic satisfiability
Artificial Intelligence - special issue on planning with uncertainty and incomplete information
Learning evaluation functions to improve optimization by local search
The Journal of Machine Learning Research
Worst-case study of local search for MAX-k-SAT
Discrete Applied Mathematics - The renesse issue on satisfiability
Solving Hierarchical Constraints over Finite Domains with Local Search
Annals of Mathematics and Artificial Intelligence
On SAT Instance Classes and a Method for Reliable Performance Experiments with SAT Solvers
Annals of Mathematics and Artificial Intelligence
UnitWalk: A New SAT Solver that Uses Local Search Guided by Unit Clause Elimination
Annals of Mathematics and Artificial Intelligence
Effective bounding techniques for solving unate and binate covering problems
Proceedings of the 42nd annual Design Automation Conference
MaxSolver: an efficient exact algorithm for (weighted) maximum satisfiability
Artificial Intelligence
Efficient initial solution to extremal optimization algorithm for weighted MAXSAT problem
IEA/AIE'2003 Proceedings of the 16th international conference on Developments in applied artificial intelligence
Clause Weighting Local Search for SAT
Journal of Automated Reasoning
Random backtracking in backtrack search algorithms for satisfiability
Discrete Applied Mathematics
Understanding the role of noise in stochastic local search: Analysis and experiments
Artificial Intelligence
Boosting Haplotype Inference with Local Search
Constraints
Justification-Based Local Search with Adaptive Noise Strategies
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Using Cost Distributions to Guide Weight Decay in Local Search for SAT
PRICAI '08 Proceedings of the 10th Pacific Rim International Conference on Artificial Intelligence: Trends in Artificial Intelligence
Learning While Optimizing an Unknown Fitness Surface
Learning and Intelligent Optimization
Tuning Local Search by Average-Reward Reinforcement Learning
Learning and Intelligent Optimization
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Justification-Based Non-Clausal Local Search for SAT
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Additive versus multiplicative clause weighting for SAT
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Towards efficient sampling: exploiting random walk strategies
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Old resolution meets modern SLS
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
SymChaff: a structure-aware satisfiability solver
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Backbone fragility and the local search cost peak
Journal of Artificial Intelligence Research
Automatic SAT-compilation of planning problems
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
SAT-encodings, search space structure, and local search performance
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
To encode or not to encode-1: linear planning
IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
From sampling to model counting
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Backbone guided local search for maximum satisfiability
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Sampling combinatorial spaces using biased random walks
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
The exponentiated subgradient algorithm for heuristic Boolean programming
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability
Artificial Intelligence
SATenstein: automatically building local search SAT solvers from components
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Massively parallel evolution of SAT heuristics
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
ISICA '09 Proceedings of the 4th International Symposium on Advances in Computation and Intelligence
Improving GASAT by replacing tabu search by DLM and enhancing the best members
Artificial Intelligence Review
Relaxed survey propagation for the weighted maximum satisfiability problem
Journal of Artificial Intelligence Research
A stochastic non-CNF SAT solver
PRICAI'06 Proceedings of the 9th Pacific Rim international conference on Artificial intelligence
Combining adaptive noise and look-ahead in local search for SAT
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Advances in local search for satisfiability
AI'07 Proceedings of the 20th Australian joint conference on Advances in artificial intelligence
Weight redistribution for unweighted MAX-SAT
AI'07 Proceedings of the 20th Australian joint conference on Advances in artificial intelligence
Improvements to hybrid incremental SAT algorithms
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Speeding-up non-clausal local search for propositional satisfiability with clause learning
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Solving graph coloring problems using learning automata
EvoCOP'08 Proceedings of the 8th European conference on Evolutionary computation in combinatorial optimization
Combining finite learning automata with GSAT for the satisfiability problem
Engineering Applications of Artificial Intelligence
An Approach for Solving Large SAT Problems on FPGA
ACM Transactions on Reconfigurable Technology and Systems (TRETS)
Boosting local search thanks to CDCL
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Journal of Automated Reasoning
Local search with edge weighting and configuration checking heuristics for minimum vertex cover
Artificial Intelligence
A CSP solver focusing on FAC variables
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Evaluating las vegas algorithms: pitfalls and remedies
UAI'98 Proceedings of the Fourteenth conference on Uncertainty in artificial intelligence
Performance prediction and automated tuning of randomized and parametric algorithms
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Adaptive clause weight redistribution
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
UBCSAT: an implementation and experimentation environment for SLS algorithms for SAT and MAX-SAT
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Symmetry breaking and local search spaces
CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Resolution tunnels for improved SAT solver performance
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Diversification and determinism in local search for satisfiability
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Random walk with continuously smoothed variable weights
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Constraint metrics for local search
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Threshold behaviour of WalkSAT and focused metropolis search on random 3-satisfiability
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Improving stochastic local search for SAT with a new probability distribution
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Dynamic scoring functions with variable expressions: new SLS methods for solving SAT
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Satisfiability checking of non-clausal formulas using general matings
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Improving parallel local search for SAT
LION'05 Proceedings of the 5th international conference on Learning and Intelligent Optimization
Adaptive memory-based local search for MAX-SAT
Applied Soft Computing
Multi-agent collaborative service and distributed problem solving
Cognitive Systems Research
Choosing probability distributions for stochastic local search and the role of make versus break
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Satisfying versus falsifying in local search for satisfiability
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Exploiting historical relationships of clauses and variables in local search for satisfiability
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
A multilevel memetic algorithm for large sat-encoded problems
Evolutionary Computation
Stochastic Learning for SAT-Encoded Graph Coloring Problems
International Journal of Applied Metaheuristic Computing
A method to avoid duplicative flipping in local search for SAT
AI'12 Proceedings of the 25th Australasian joint conference on Advances in Artificial Intelligence
From sequential to parallel local search for SAT
EvoCOP'13 Proceedings of the 13th European conference on Evolutionary Computation in Combinatorial Optimization
Using cross-entropy for satisfiability
Proceedings of the 28th Annual ACM Symposium on Applied Computing
A survey of the satisfiability-problems solving algorithms
International Journal of Advanced Intelligence Paradigms
Local search for Boolean Satisfiability with configuration checking and subscore
Artificial Intelligence
Weight-enhanced diversification in stochastic local search for satisfiability
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Using automatic programming to generate state-of-the-art algorithms for random 3-SAT
Journal of Heuristics
| Hi-index | 0.00 |
It is well known that the performance of a stochastic local search procedure depends upon the setting of its noise parameter, and that the optimal setting varies with the problem distribution. It is therefore desirable to develop general priniciples for tuning the procedures. We present two statistical measures of the local search process that allow one to quickly find the optimal noise settings. These properties are independent of the fine details of the local search strategies, and appear to be relatively independent of the structure of the problem domains. We applied these principles to the problem of evaluating new search heuristics, and discovered two promising new strategies.