Noise strategies for improving local search
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Phase transitions and the search problem
Artificial Intelligence - Special volume on frontiers in problem solving: phase transitions and complexity
Morphing: combining structure and randomness
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
Towards a characterisation of the behaviour of stochastic local search algorithms for SAT
Artificial Intelligence
Small worlds: the dynamics of networks between order and randomness
Small worlds: the dynamics of networks between order and randomness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems
Journal of Automated Reasoning
Resolution versus Search: Two Strategies for SAT
Journal of Automated Reasoning
The Asymptotic Order of the Random k -SAT Threshold
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Criticality and Parallelism in Structured SAT Instances
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Design of a New Metaheuristic for MAXSAT Problems
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
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
Metaheuristics in combinatorial optimization: Overview and conceptual comparison
ACM Computing Surveys (CSUR)
IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
A new method for solving hard satisfiability problems
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Hard and easy distributions of SAT problems
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
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
Indexing Network Structure with Shortest-Path Trees
ACM Transactions on Knowledge Discovery from Data (TKDD)
| Hi-index | 0.00 |
The impact of problem structure on search is a relevant issue in artificial intelligence and related areas. Among the possible approaches to analyze problem structure, the one referring to constraint graph enables to relate graph parameters and characteristics with search algorithm behavior. In this work, we investigate the behavior of local search applied to SAT instances associated to graphs with small-world topology. Small-world graphs, such as friendship networks, have low characteristic path length and high clustering. In this work, we first present a procedure to generate SAT instances characterized by an interaction graph with a small-world topology. Then we show experimental results concerning the behavior of local search algorithms applied to this benchmark.