Easy problems are sometimes hard
Artificial Intelligence
Phase transitions and the search problem
Artificial Intelligence - Special volume on frontiers in problem solving: phase transitions and complexity
Boosting combinatorial search through randomization
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Which search problems are random?
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
New methods to color the vertices of a graph
Communications of the ACM
Problem structure in the presence of perturbations
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Proceedings of the Joint JSAI 2001 Workshop on New Frontiers in Artificial Intelligence
An Investigation of Variable Relationships in 3-SAT Problems
AI '02 Proceedings of the 15th Australian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
Formal Models of Heavy-Tailed Behavior in Combinatorial Search
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Criticality and Parallelism in Structured SAT Instances
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
Restart Policies with Dependence among Runs: A Dynamic Programming Approach
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
KeyWorld: Extracting Keywords from a Document as a Small World
DS '01 Proceedings of the 4th International Conference on Discovery Science
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
On the Fine Structure of Large Search Spaces
ICTAI '99 Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence
Strategies for Solving SAT in Grids by Randomized Search
Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics
Modeling and Designing Real---World Networks
Algorithmics of Large and Complex Networks
Restart Strategy Selection Using Machine Learning Techniques
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Problem-Sensitive Restart Heuristics for the DPLL Procedure
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Exploring the influence of problem structural characteristics on evolutionary algorithm performance
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Hard QBF Encodings Made Easy: Dream or Reality?
AI*IA '09: Proceedings of the XIth International Conference of the Italian Association for Artificial Intelligence Reggio Emilia on Emergent Perspectives in Artificial Intelligence
On universal restart strategies for backtracking search
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Closing the open shop: contradicting conventional wisdom
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Concurrency and network disassortativity
Artificial Life
Evaluating and Improving Modern Variable and Revision Ordering Strategies in CSPs
Fundamenta Informaticae - RCRA 2008 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
Is computational complexity a barrier to manipulation?
CLIMA'10 Proceedings of the 11th international conference on Computational logic in multi-agent systems
Indexing Network Structure with Shortest-Path Trees
ACM Transactions on Knowledge Discovery from Data (TKDD)
Recovering indirect solution densities for counting-based branching heuristics
CPAIOR'11 Proceedings of the 8th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Between restarts and backjumps
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Models and strategies for variants of the job shop scheduling problem
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Domain-splitting generalized nogoods from restarts
EPIA'11 Proceedings of the 15th Portugese conference on Progress in artificial intelligence
On the impact of small-world on local search
AI*IA'05 Proceedings of the 9th conference on Advances in Artificial Intelligence
Is computational complexity a barrier to manipulation?
Annals of Mathematics and Artificial Intelligence
Randomization in constraint programming for airline planning
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Describing and simulating internet routes
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
Asymptotically optimal solutions for small world graphs
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Efficient detection of errors in java components using random environment and restarts
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Job shop scheduling with setup times and maximal time-lags: a simple constraint programming approach
CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Characterization of a new restart strategy for randomized backtrack search
CSCLP'04 Proceedings of the 2004 joint ERCIM/CoLOGNET international conference on Recent Advances in Constraints
Effect of DisCSP variable-ordering heuristics in scale-free networks
PRIMA'10 Proceedings of the 13th international conference on Principles and Practice of Multi-Agent Systems
Where are the hard manipulation problems?
Journal of Artificial Intelligence Research
An Optimal Constraint Programming Approach to the Open-Shop Problem
INFORMS Journal on Computing
Complete characterization of near-optimal sequences for the two-machine flow shop scheduling problem
CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
The community structure of SAT formulas
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
A Restarted Strategy for Efficient Subsumption Testing
Fundamenta Informaticae - Progress on Multi-Relational Data Mining
Counting-based search: branching heuristics for constraint satisfaction problems
Journal of Artificial Intelligence Research
Distributed tree decomposition with privacy
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Eigenvector centrality in industrial SAT instances
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Solving RCPSP/max by lazy clause generation
Journal of Scheduling
Future Generation Computer Systems
Effect of DisCSP variable-ordering heuristics in scale-free networks
Multiagent and Grid Systems - Principles and Practice of Multi-Agent Systems
| Hi-index | 0.00 |
In a graph with a "small world" topology, nodes are highly clustered yet the path length between them is small. Such a topology can make search problems very difficult since local decisions quickly propagate globally. We show that graphs associated with many different search problems have a small world topology, and that the cost of solving such search problems can have a heavy-tailed distribution. The strategy of randomization and restarts appears to eliminate these heavy tails. A novel restart schedule in which the cutoff bound is increased geometrically appears particularly effective.