Joseph C. Culberson

According to our database1, Joseph C. Culberson authored at least 39 papers between 1985 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
Cost-Driven Data Caching in the Cloud: An Algorithmic Approach.
Proceedings of the 40th IEEE Conference on Computer Communications, 2021

2017
Data Caching in Next Generation Mobile Cloud Services, Online vs. Off-Line.
Proceedings of the 46th International Conference on Parallel Processing, 2017

2009
DP-Complete Problems Derived from Extremal NP-Complete Properties.
Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

2008
A General Theory of Additive State Space Abstractions.
J. Artif. Intell. Res., 2008

2007
Consistency and Random Constraint Satisfaction Models.
J. Artif. Intell. Res., 2007

Using Infeasibility to Improve Abstraction-Based Heuristics.
Proceedings of the Abstraction, 2007

2005
Space Complexity of Estimation of Distribution Algorithms.
Evol. Comput., 2005

Recognizing Maximal Unfrozen Graphs with respect to Independent Sets is CO-NP-complete.
Discret. Math. Theor. Comput. Sci., 2005

Resolution complexity of random constraint satisfaction problems: Another half of the story.
Discret. Appl. Math., 2005

The resolution complexity of random graph <i>k</i>-colorability.
Discret. Appl. Math., 2005

On the complexity of unfrozen problems.
Discret. Appl. Math., 2005

Phase Transitions of Dominating Clique Problem and Their Implications to Heuristics in Satisfiability Search.
Proceedings of the IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30, 2005

2004
The Resolution Complexity of Random Graph k-Colorability
Electron. Colloquium Comput. Complex., 2004

Consistency and Random Constraint Satisfaction Models with a High Constraint Tightness.
Proceedings of the Principles and Practice of Constraint Programming, 2004

2003
On the Treewidth of NK Landscapes.
Proceedings of the Genetic and Evolutionary Computation, 2003

2002
An Analysis of Phase Transition in NK Landscapes.
J. Artif. Intell. Res., 2002

2001
Frozen development in graph coloring.
Theor. Comput. Sci., 2001

1998
The Gn, m Phase Transition is Not Hard for the Hamiltonian Cycle Problem.
J. Artif. Intell. Res., 1998

On the Futility of Blind Search: An Algorithmic View of "No Free Lunch".
Evol. Comput., 1998

Pattern Databases.
Comput. Intell., 1998

1996
On Searching \alpha-ary Hypercubes and Related Graphs.
Proceedings of the 4th Workshop on Foundations of Genetic Algorithms. San Diego, 1996

Searching with Pattern Databases.
Proceedings of the Advances in Artificial Intelligence, 1996

1995
Multicommodity flows in simple multistage networks.
Networks, 1995

1994
Covering Polygons Is Hard.
J. Algorithms, 1994

Mutation-Crossover Isomorphisms and the Construction of Discriminating Functions.
Evol. Comput., 1994

1993
Searching in the Plane
Inf. Comput., October, 1993

Crossover versus Mutation: Fueling the Debate: TGA versus GIGA.
Proceedings of the 5th International Conference on Genetic Algorithms, 1993

Exploring the k-colorable landscape with Iterated Greedy.
Proceedings of the Cliques, 1993

Camouflaging independent sets in quasi-random graphs.
Proceedings of the Cliques, 1993

1992
A World Championship Caliber Checkers Program.
Artif. Intell., 1992

1990
Analysis of the Standard Deletion Algorithms in Exact Fit Domain Binary Search Trees.
Algorithmica, 1990

1989
Orthogonally Convex Coverings of Orthogonal Polygons without Holes.
J. Comput. Syst. Sci., 1989

A Fast Algorithm for Constructing Trees from Distance Matrices.
Inf. Process. Lett., 1989

Explaining the Behaviour of Binary Search Trees Under Prolonged Updates: A Model and Simulations.
Comput. J., 1989

1988
Searching with Uncertainty (Extended Abstract).
Proceedings of the SWAT 88, 1988

Covering Polygons Is Hard (Preliminary Abstract)
Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988

1987
Covering a Simple Orthogonal Polygon with a Minimum Number of Orthogonally Convex Polygons.
Proceedings of the Third Annual Symposium on Computational Geometry, 1987

1985
The Effect of Updates in Binary Search Trees
Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 1985

Turtlegons: generating simple polygons for sequences of angles.
Proceedings of the First Annual Symposium on Computational Geometry, 1985


  Loading...