Joseph C. Culberson

44 papers A* 4A 3B 2Misc 1Journal 27Unranked 7
YearRankTypeTitle / Venue / Authors
2021 A* conf
Cost-Driven Data Caching in the Cloud: An Algorithmic Approach.
INFOCOM
Yang Wang, Yong Zhang, Xinxin Han, Pengfei Wang, Chengzhong Xu, Joseph Horton, Joseph C. Culberson
2017 B conf
Data Caching in Next Generation Mobile Cloud Services, Online vs. Off-Line.
ICPP
Yang Wang, Shuibing He, Xiaopeng Fan, Chengzhong Xu, Joseph C. Culberson, Joseph Horton
2011 J jnl
A General Theory of Additive State Space Abstractions
CoRR
Fan Yang, Joseph C. Culberson, Robert Holte, Uzi Zahavi, Ariel Felner
2011 J jnl
An Analysis of Phase Transition in NK Landscapes
CoRR
Joseph C. Culberson, Yong Gao
2011 J jnl
Consistency and Random Constraint Satisfaction Models
CoRR
Joseph C. Culberson, Yong Gao
2011 J jnl
The Gn,m Phase Transition is Not Hard for the Hamiltonian Cycle Problem
CoRR
Joseph C. Culberson, Basil Vandegriend
2009 B conf
DP-Complete Problems Derived from Extremal NP-Complete Properties.
MFCS
Yi Cao, Joseph C. Culberson, Lorna Stewart
2008 J jnl
A General Theory of Additive State Space Abstractions.
J. Artif. Intell. Res.
Fan Yang, Joseph C. Culberson, Robert Holte, Uzi Zahavi, Ariel Felner
2007 J jnl
Consistency and Random Constraint Satisfaction Models.
J. Artif. Intell. Res.
Yong Gao, Joseph C. Culberson
2007 — conf
Using Infeasibility to Improve Abstraction-Based Heuristics.
SARA
Fan Yang, Joseph C. Culberson, Robert Holte
2005 J jnl
On the complexity of unfrozen problems.
Discret. Appl. Math.
Adam Beacham, Joseph C. Culberson
2005 A* conf
Phase Transitions of Dominating Clique Problem and Their Implications to Heuristics in Satisfiability Search.
IJCAI
Joseph C. Culberson, Yong Gao, Calin Anton
2005 J jnl
Recognizing Maximal Unfrozen Graphs with respect to Independent Sets is CO-NP-complete.
Discret. Math. Theor. Comput. Sci.
Nesrine Abbas, Joseph C. Culberson, Lorna Stewart
2005 J jnl
Resolution complexity of random constraint satisfaction problems: Another half of the story.
Discret. Appl. Math.
Yong Gao, Joseph C. Culberson
2005 J jnl
Space Complexity of Estimation of Distribution Algorithms.
Evol. Comput.
Yong Gao, Joseph C. Culberson
2005 J jnl
The resolution complexity of random graph
Discret. Appl. Math.
Paul Beame, Joseph C. Culberson, David G. Mitchell, Cristopher Moore
2004 A conf
Consistency and Random Constraint Satisfaction Models with a High Constraint Tightness.
CP
Yong Gao, Joseph C. Culberson
2004 J jnl
The Resolution Complexity of Random Graph k-Colorability
Electron. Colloquium Comput. Complex.
Paul Beame, Joseph C. Culberson, David G. Mitchell, Cristopher Moore
2003 A conf
On the Treewidth of NK Landscapes.
GECCO
Yong Gao, Joseph C. Culberson
2003 J jnl
Resolution Complexity of Random Constraint Satisfaction Problems: Another Half of the Story.
Electron. Notes Discret. Math.
Yong Gao, Joseph C. Culberson
2002 J jnl
An Analysis of Phase Transition in NK Landscapes.
J. Artif. Intell. Res.
Yong Gao, Joseph C. Culberson
2001 J jnl
Frozen development in graph coloring.
Theor. Comput. Sci.
Joseph C. Culberson, Ian P. Gent
1998 J jnl
On the Futility of Blind Search: An Algorithmic View of "No Free Lunch".
Evol. Comput.
Joseph C. Culberson
1998 J jnl
Pattern Databases.
Comput. Intell.
Joseph C. Culberson, Jonathan Schaeffer
1998 J jnl
The Gn, m Phase Transition is Not Hard for the Hamiltonian Cycle Problem.
J. Artif. Intell. Res.
Basil Vandegriend, Joseph C. Culberson
1996 A conf
On Searching \alpha-ary Hypercubes and Related Graphs.
FOGA
Joseph C. Culberson, Jonathan Lichtner
1996 Misc conf
Searching with Pattern Databases.
AI
Joseph C. Culberson, Jonathan Schaeffer
1995 J jnl
Multicommodity flows in simple multistage networks.
Networks
Ehab S. Elmallah, Joseph C. Culberson
1994 J jnl
Covering Polygons Is Hard.
J. Algorithms
Joseph C. Culberson, Robert A. Reckhow
1994 J jnl
Mutation-Crossover Isomorphisms and the Construction of Discriminating Functions.
Evol. Comput.
Joseph C. Culberson
1993 — conf
Camouflaging independent sets in quasi-random graphs.
Cliques, Coloring, and Satisfiability
Mark Brockington, Joseph C. Culberson
1993 — conf
Crossover versus Mutation: Fueling the Debate: TGA versus GIGA.
ICGA
Joseph C. Culberson
1993 — conf
Exploring the k-colorable landscape with Iterated Greedy.
Cliques, Coloring, and Satisfiability
Joseph C. Culberson, Feng Luo
1993 J jnl
Searching in the Plane
Inf. Comput.
Ricardo A. Baeza-Yates, Joseph C. Culberson, Gregory J. E. Rawlins
1992 J jnl
A World Championship Caliber Checkers Program.
Artif. Intell.
Jonathan Schaeffer, Joseph C. Culberson, Norman Treloar, Brent Knight, Paul Lu, Duane Szafron
1990 J jnl
Analysis of the Standard Deletion Algorithms in Exact Fit Domain Binary Search Trees.
Algorithmica
Joseph C. Culberson, J. Ian Munro
1989 J jnl
A Fast Algorithm for Constructing Trees from Distance Matrices.
Inf. Process. Lett.
Joseph C. Culberson, Piotr Rudnicki
1989 J jnl
Explaining the Behaviour of Binary Search Trees Under Prolonged Updates: A Model and Simulations.
Comput. J.
Joseph C. Culberson, J. Ian Munro
1989 J jnl
Orthogonally Convex Coverings of Orthogonal Polygons without Holes.
J. Comput. Syst. Sci.
Joseph C. Culberson, Robert A. Reckhow
1988 A* conf
Covering Polygons Is Hard (Preliminary Abstract)
FOCS
Joseph C. Culberson, Robert A. Reckhow
1988 — conf
Searching with Uncertainty (Extended Abstract).
SWAT
Ricardo A. Baeza-Yates, Joseph C. Culberson, Gregory J. E. Rawlins
1987 — conf
Covering a Simple Orthogonal Polygon with a Minimum Number of Orthogonally Convex Polygons.
SCG
Robert A. Reckhow, Joseph C. Culberson
1985 A* conf
The Effect of Updates in Binary Search Trees
STOC
Joseph C. Culberson
1985 — conf
Turtlegons: generating simple polygons for sequences of angles.
SCG
Joseph C. Culberson, Gregory J. E. Rawlins