Morphing: combining structure and randomness

Authors:
Ian P. Gent;Holger H. Hoos;Patrick Prosser;Toby Walsh
Affiliations:
-;-;-;-
Venue:
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
Year:
1999

Citing 2
Cited 30

Boosting combinatorial search through randomization

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
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

Modelling More Realistic SAT Problems

AI '02 Proceedings of the 15th Australian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
Criticality and Parallelism in Structured SAT Instances

CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Systematic vs. Local Search for SAT

KI '99 Proceedings of the 23rd Annual German Conference on Artificial Intelligence: Advances in Artificial Intelligence
SAT problems with chains of dependent variables

Discrete Applied Mathematics - The renesse issue on satisfiability
Space Complexity of Estimation of Distribution Algorithms

Evolutionary Computation
Clause Weighting Local Search for SAT

Journal of Automated Reasoning
Stochastic local search for incremental SAT

International Journal of Knowledge-based and Intelligent Engineering Systems
Using previous models to bias structural learning in the hierarchical BOA

Proceedings of the 10th annual conference on Genetic and evolutionary computation
The backdoor key: a path to understanding problem hardness

AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Automatic algorithm configuration based on local search

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Learning restart strategies

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Search on high degree graphs

IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Phase transitions of dominating clique problem and their implications to heuristics in satisfiability search

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
SATenstein: automatically building local search SAT solvers from components

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
ParamILS: an automatic algorithm configuration framework

Journal of Artificial Intelligence Research
Hierarchical BOA solves ising spin glasses and MAXSAT

GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII
Hierarchical hardness models for SAT

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
On the structure of industrial SAT instances

CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
An Empirical Study of the Manipulability of Single Transferable Voting

Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
ISAC --Instance-Specific Algorithm Configuration

Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Is computational complexity a barrier to manipulation?

CLIMA'10 Proceedings of the 11th international conference on Computational logic in multi-agent systems
Tradeoffs in the empirical evaluation of competing algorithm designs

Annals of Mathematics and 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
Impact of censored sampling on the performance of restart strategies

CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
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
Using previous models to bias structural learning in the hierarchical boa

Evolutionary Computation
Where are the hard manipulation problems?

Journal of Artificial Intelligence Research
The community structure of SAT formulas

SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Transfer learning, soft distance-based bias, and the hierarchical BOA

PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce a mechanism called "morphing" for introducing structure or randomness into a wide variety of problems. We illustrate the usefulness of morphing by performing several different experimental studies. These studies identify the impact of a "small-world" topology on the cost of coloring graphs, of asymmetry on the cost of finding the optimal TSP tour, and of the dimensionality of space on the cost of finding the optimal TSP tour. We predict that morphing will find many other uses.