Joseph C. Culberson

Publication Activity (10 Years)

Years Active: 1985-2021
Publications (10 Years): 2

Top Topics

Mobile Environments

Top Venues

Publications

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