Yong Gao, Joseph Culberson  Home/Search
Context
Related
| cs.ualberta.ca/~yg...obab_landscape.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.ualberta.ca/~yg...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In recent years, the study of the phase transition behavior and typical-case complexity of search and optimization problems have become an active research topic, drawing attention from researchers from computer science, mathematics, and statistical physics. The probabilistic method that has been developed since 1960s plays an important role in this development. We give a brief introduction to the problems, techniques, and results in the phase transition analysis of search and ... (Update)
Active bibliography (related documents): More All
1.7: On the Treewidth of NK Landscapes - Yong Gao And (2003) (Correct)
0.8: Resolution Complexity of Random Constraint Satisfaction.. - Gao, Culberson (Correct)
0.5: A Random Walk in Statistical Physics - Svenson (Correct)
Similar documents based on text: More All
0.2: The Phase Transition in NK Landscapes is Easy - Gao, Culberson (2001) (Correct)
0.1: Threshold Phenomena in NK Landscapes - Gao (2001) (Correct)
0.1: Frozen Development in Graph Coloring - Culberson, Gent (2000) (Correct)
BibTeX entry: (Update)
@misc{ gao-probabilistic,
author = "Yong Gao and Joseph Culberson",
title = "Probabilistic Methods in Landscape Analysis: Phase Transitions Interaction
Structures, and Complexity Measures",
url = "citeseer.ist.psu.edu/676451.html" }
Citations (may not include all citations):1543 Probabilistic Reasoning in Intelligent Systems: Networks of .. (context) - Pearl - 1988
957 The Probabilistic Method (context) - Alon, Spencer et al. - 1992
329 Where the really hard problems are - Cheeseman, Kanefsky et al. - 1991
320 Hard and easy distributions of sat problems - Mitchell, Selman et al. - 1992
176 No free lunch theorems for optimization - Wolpert, Macready - 1997
134 Experimental results on the crossover point in satisfiabilit.. - Crawford, Auton - 1993
132 the evolution of random graphs (context) - Erdos, Renyi - 1960
81 Critical behavior in the satisfiability of random boolean ex.. - Kirkpatrick, Selman - 1994
63 A survey of optimization by building and using probabilistic.. - Pelikan, Goldberg et al. - 1999
55 Cambridge University Press (context) - Bollobas - 2001
46 Fitness Landscapes and Search (context) - Jones - 1995
39 Finding hard instances of the satisfiability problem: A surv.. - Cook, Mitchell - 1997
38 The Origins of Order: Self-organization and Selection in Evo.. (context) - man - 1993
32 phase transitions (context) - Monasson, Zecchina et al.
30 distributions and graphical models in evolutionary optimizat.. (context) - Muhlenbein, Mahnig et al. - 1999
30 Sharp thresholds of graph properties (context) - Friedgut - 1999
24 Generating satisfiable problem instances - Achlioptas, Gomes et al. - 2000
23 Algorithms for satisfiability (context) - Gu, Purdom et al. - 1997
20 Evolutionary Computation (context) - Hordijk - 1997
19 Estimation of Distribution Algorithms: A New Tool for Evolut.. (context) - Larranaga, Lozano - 2001
18 Convergence theory and applications of the factorized distri.. - Muhlenbein, Mahnig - 1999
17 sat: Relation of typical-case complexity to the nature of th.. (context) - Monasson, Zecchina et al. - 1999
16 A general upper bounds for the satisfiability threshold of r.. (context) - Dubois, Boufkhad - 1997
14 Can't get no satisfaction (context) - Hayes - 1997
10 American Scientist (context) - Hayes - 2003
10 Well out of reach: Why hard problems are hard - Culberson, Gent - 1999
9 Degree of population diversity - a perspective on premature .. - Leung, Gao et al. - 1997
8 Combinatorial optimization by learning and simulation of bay.. (context) - Larranaga, Etxeberria et al. - 2002
6 Statistical mechanics methods and phase transition in optimi.. - Martin, Monasson et al. - 2001
6 no free lunch (context) - Culberson - 1998
3 Space complexity of estimation of distribution algoritms (context) - Gao, Culberson - 2003
3 A genetic-based method for training fuzzy systems (context) - Leung, Gao et al. - 2001
3 An analysis of phase transition in NK landscapes - Gao, Culberson - 2002
2 NP completeness of Kau#man's NK model (context) - Weinberger - 1996
2 The computational complexity of NK fitness functions - Wright, Thompson et al. - 2000
2 A survey of lower bounds for random 3-sat via di#erential eq.. (context) - Achlioptas - 2001
1 The easiest hard problem (context) - Hayes - 2002
1 the treewidth of NK landscapes - Gao, Culberson - 2003
1 SAT threshold is 2 log2 o (context) - Achlioptas, Peres - 2003
1 The phase transition in nk landscapes is easy - Gao, Culberson - 2001
1 Hard random 3-sat problems and the davis-putman procedure (context) - Freeman - 1996
Documents on the same site (http://www.cs.ualberta.ca/~ygao/research/publications.html): More
Degree of Population Diversity - A Perspective on Premature.. - Leung, Gao, Xu (1997) (Correct)
Population Size and Sampling Complexity in Genetic Algorithms - Gao (2003) (Correct)
Phase Transition of Tractability in Constraint Satisfaction and.. - Gao (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC