Joseph C. Culberson

Joseph C. Culberson, Basil Vandegriend: The Gn,m Phase Transition is Not Hard for the Hamiltonian Cycle Problem. CoRR abs/1105.5443 (2011)

Joseph C. Culberson, Yong Gao: An Analysis of Phase Transition in NK Landscapes. CoRR abs/1106.4575 (2011)

Joseph C. Culberson, Yi Gao: Consistency and Random Constraint Satisfaction Models. CoRR abs/1110.2204 (2011)

Fan Yang, Joseph C. Culberson, Robert Holte, Uzi Zahavi, Ariel Felner: A General Theory of Additive State Space Abstractions. CoRR abs/1111.0067 (2011)

Yi Cao, Joseph C. Culberson, Lorna Stewart: DP-Complete Problems Derived from Extremal NP-Complete Properties. MFCS 2009: 199-210

Fan Yang, Joseph C. Culberson, Robert Holte, Uzi Zahavi, Ariel Felner: A General Theory of Additive State Space Abstractions. J. Artif. Intell. Res. (JAIR) 32: 631-662 (2008)

Yong Gao, Joseph C. Culberson: Consistency and Random Constraint Satisfaction Models. J. Artif. Intell. Res. (JAIR) 28: 517-557 (2007)

Fan Yang, Joseph C. Culberson, Robert Holte: Using Infeasibility to Improve Abstraction-Based Heuristics. SARA 2007: 413-414

Adam Beacham, Joseph C. Culberson: On the complexity of unfrozen problems. Discrete Applied Mathematics 153(1-3): 3-24 (2005)

Paul Beame, Joseph C. Culberson, David G. Mitchell, Cristopher Moore: The resolution complexity of random graph k-colorability. Discrete Applied Mathematics 153(1-3): 25-47 (2005)

Yong Gao, Joseph C. Culberson: Resolution complexity of random constraint satisfaction problems: Another half of the story. Discrete Applied Mathematics 153(1-3): 124-140 (2005)

Nesrine Abbas, Joseph C. Culberson, Lorna Stewart: Recognizing Maximal Unfrozen Graphs with respect to Independent Sets is CO-NP-complete. Discrete Mathematics & Theoretical Computer Science 7(1): 141-154 (2005)

Yong Gao, Joseph C. Culberson: Space Complexity of Estimation of Distribution Algorithms. Evolutionary Computation 13(1): 125-143 (2005)

Joseph C. Culberson, Yong Gao, Calin Anton: Phase Transitions of Dominating Clique Problem and Their Implications to Heuristics in Satisfiability Search. IJCAI 2005: 78-83

Yong Gao, Joseph C. Culberson: Consistency and Random Constraint Satisfaction Models with a High Constraint Tightness. CP 2004: 17-31

Paul Beame, Joseph C. Culberson, David G. Mitchell, Cristopher Moore: The Resolution Complexity of Random Graph k-Colorability. Electronic Colloquium on Computational Complexity (ECCC)(012) (2004)

Yong Gao, Joseph C. Culberson: Resolution Complexity of Random Constraint Satisfaction Problems: Another Half of the Story. Electronic Notes in Discrete Mathematics 16: 15-20 (2003)

Yong Gao, Joseph C. Culberson: On the Treewidth of NK Landscapes. GECCO 2003: 948-954

Yong Gao, Joseph C. Culberson: An Analysis of Phase Transition in NK Landscapes. J. Artif. Intell. Res. (JAIR) 17: 309-332 (2002)

Joseph C. Culberson, Ian P. Gent: Frozen development in graph coloring. Theor. Comput. Sci. 265(1-2): 227-264 (2001)

Joseph C. Culberson, Jonathan Schaeffer: Pattern Databases. Computational Intelligence 14(3): 318-334 (1998)

Joseph C. Culberson: On the Futility of Blind Search: An Algorithmic View of ``No Free Lunch''. Evolutionary Computation 6(2): 109-127 (1998)

Basil Vandegriend, Joseph C. Culberson: The Gn, m Phase Transition is Not Hard for the Hamiltonian Cycle Problem. J. Artif. Intell. Res. (JAIR) 9: 219-245 (1998)

Joseph C. Culberson, Jonathan Schaeffer: Searching with Pattern Databases. Canadian Conference on AI 1996: 402-416

Joseph C. Culberson, Jonathan Lichtner: On Searching \alpha-ary Hypercubes and Related Graphs. FOGA 1996: 263-290

Joseph C. Culberson: Mutation-Crossover Isomorphisms and the Construction of Discriminating Functions. Evolutionary Computation 2(3): 279-311 (1994)

Joseph C. Culberson, Robert A. Reckhow: Covering Polygons Is Hard. J. Algorithms 17(1): 2-44 (1994)

Ricardo A. Baeza-Yates, Joseph C. Culberson, Gregory J. E. Rawlins: Searching in the Plane. Inf. Comput. 106(2): 234-252 (1993)

Joseph C. Culberson: Crossover versus Mutation: Fueling the Debate: TGA versus GIGA. ICGA 1993: 632

Jonathan Schaeffer, Joseph C. Culberson, Norman Treloar, Brent Knight, Paul Lu, Duane Szafron: A World Championship Caliber Checkers Program. Artif. Intell. 53(2-3): 273-289 (1992)

Joseph C. Culberson, J. Ian Munro: Analysis of the Standard Deletion Algorithms in Exact Fit Domain Binary Search Trees. Algorithmica 5(3): 295-311 (1990)

Joseph C. Culberson, J. Ian Munro: Explaining the Behaviour of Binary Search Trees Under Prolonged Updates: A Model and Simulations. Comput. J. 32(1): 68-75 (1989)

Joseph C. Culberson, Piotr Rudnicki: A Fast Algorithm for Constructing Trees from Distance Matrices. Inf. Process. Lett. 30(4): 215-220 (1989)

Joseph C. Culberson, Robert A. Reckhow: Orthogonally Convex Coverings of Orthogonal Polygons without Holes. J. Comput. Syst. Sci. 39(2): 166-204 (1989)

Joseph C. Culberson, Robert A. Reckhow: Covering Polygons Is Hard (Preliminary Abstract). FOCS 1988: 601-611

Ricardo A. Baeza-Yates, Joseph C. Culberson, Gregory J. E. Rawlins: Searching with Uncertainty (Extended Abstract). SWAT 1988: 176-189

Robert A. Reckhow, Joseph C. Culberson: Covering a Simple Orthogonal Polygon with a Minimum Number of Orthogonally Convex Polygons. Symposium on Computational Geometry 1987: 268-277

Joseph C. Culberson, Gregory J. E. Rawlins: Turtlegons: generating simple polygons for sequences of angles. Symposium on Computational Geometry 1985: 305-310

Joseph C. Culberson: The Effect of Updates in Binary Search Trees. STOC 1985: 205-212