Difference between revisions of "Joe Culberson"
GerdIsenberg (talk | contribs) (Created page with "'''Home * People * Joe Culberson''' FILE:joeculberson.jpg|border|right|thumb|link=http://webdocs.cs.ualberta.ca/%7Echinook/authors/| Joe Culberson <ref>[...") |
GerdIsenberg (talk | contribs) |
||
| (One intermediate revision by the same user not shown) | |||
| Line 27: | Line 27: | ||
* [[Mark Brockington]], [[Joe Culberson]] ('''1993'''). ''[https://www.semanticscholar.org/paper/Camouflaging-independent-sets-in-quasi-random-Brockington-Culberson/5deeb563ef3a06bb96e31d9c480f2ab08f49f303 Camouflaging independent sets in quasi-random graphs]''. [https://dblp.uni-trier.de/db/conf/dimacs/dimacs26.html Cliques, Coloring, and Satisfiability 1993] | * [[Mark Brockington]], [[Joe Culberson]] ('''1993'''). ''[https://www.semanticscholar.org/paper/Camouflaging-independent-sets-in-quasi-random-Brockington-Culberson/5deeb563ef3a06bb96e31d9c480f2ab08f49f303 Camouflaging independent sets in quasi-random graphs]''. [https://dblp.uni-trier.de/db/conf/dimacs/dimacs26.html Cliques, Coloring, and Satisfiability 1993] | ||
* [[Joe Culberson]], [[Jonathan Schaeffer]] ('''1996'''). ''Searching with Pattern Databases''. [https://dblp.uni-trier.de/db/conf/ai/ai96.html Canadian Conference on AI 1996], | * [[Joe Culberson]], [[Jonathan Schaeffer]] ('''1996'''). ''Searching with Pattern Databases''. [https://dblp.uni-trier.de/db/conf/ai/ai96.html Canadian Conference on AI 1996], | ||
| − | * [https://github.com/basilv Basil Vandegriend], [[Joe Culberson]] ('''1998'''). ''[https://www.jair.org/index.php/jair/article/view/10213 The Gn, m Phase Transition is Not Hard for the Hamiltonian Cycle Problem]''. [https://en.wikipedia.org/wiki/Journal_of_Artificial_Intelligence_Research JAIR], Vol. 9, [https://arxiv.org/abs/1105.5443 arXiv:1105.5443] | + | * [https://github.com/basilv Basil Vandegriend], [[Joe Culberson]] ('''1998'''). ''[https://www.jair.org/index.php/jair/article/view/10213 The Gn, m Phase Transition is Not Hard for the Hamiltonian Cycle Problem]''. [https://en.wikipedia.org/wiki/Journal_of_Artificial_Intelligence_Research JAIR], Vol. 9, [https://arxiv.org/abs/1105.5443 arXiv:1105.5443] <ref>[https://en.wikipedia.org/wiki/Hamiltonian_path_problem Hamiltonian path problem from Wikipedia]</ref> |
* [[Joe Culberson]] ('''1998'''). ''[https://www.mitpressjournals.org/doi/abs/10.1162/evco.1998.6.2.109?journalCode=evco On the Futility of Blind Search: An Algorithmic View of "No Free Lunch"]''. [https://en.wikipedia.org/wiki/Evolutionary_Computation_(journal) Evolutionary Computation], Vol. 6, No. 2 <ref>[https://en.wikipedia.org/wiki/No_free_lunch_in_search_and_optimization No free lunch in search and optimization | Wikipedia]</ref> | * [[Joe Culberson]] ('''1998'''). ''[https://www.mitpressjournals.org/doi/abs/10.1162/evco.1998.6.2.109?journalCode=evco On the Futility of Blind Search: An Algorithmic View of "No Free Lunch"]''. [https://en.wikipedia.org/wiki/Evolutionary_Computation_(journal) Evolutionary Computation], Vol. 6, No. 2 <ref>[https://en.wikipedia.org/wiki/No_free_lunch_in_search_and_optimization No free lunch in search and optimization | Wikipedia]</ref> | ||
* [[Joe Culberson]], [[Jonathan Schaeffer]] ('''1998'''). ''Pattern databases''. [https://en.wikipedia.org/wiki/Computational_Intelligence_(journal) Computational Intelligence], Vol. 14, No. 3, [http://webdocs.cs.ualberta.ca/~jonathan/publications/ai_publications/Compi_.pdf pdf] | * [[Joe Culberson]], [[Jonathan Schaeffer]] ('''1998'''). ''Pattern databases''. [https://en.wikipedia.org/wiki/Computational_Intelligence_(journal) Computational Intelligence], Vol. 14, No. 3, [http://webdocs.cs.ualberta.ca/~jonathan/publications/ai_publications/Compi_.pdf pdf] | ||
==2000 ...== | ==2000 ...== | ||
| − | * [[Yong Gao]], [[Joe Culberson]] ('''2002'''). ''[https://jair.org/index.php/jair/article/view/10314 An Analysis of Phase Transition in NK Landscapes]''. [https://en.wikipedia.org/wiki/Journal_of_Artificial_Intelligence_Research JAIR], Vol. 17, [https://arxiv.org/abs/1106.4575 arXiv:1106.4575] <ref>[https://en.wikipedia.org/wiki/NK_model NK model from Wikipedia]</ref> | + | * [[Mathematician#YongGao|Yong Gao]], [[Joe Culberson]] ('''2002'''). ''[https://jair.org/index.php/jair/article/view/10314 An Analysis of Phase Transition in NK Landscapes]''. [https://en.wikipedia.org/wiki/Journal_of_Artificial_Intelligence_Research JAIR], Vol. 17, [https://arxiv.org/abs/1106.4575 arXiv:1106.4575] <ref>[https://en.wikipedia.org/wiki/NK_model NK model from Wikipedia]</ref> |
| − | * [[Yong Gao]], [[Joe Culberson]] ('''2004'''). ''[https://link.springer.com/chapter/10.1007/978-3-540-30201-8_5 Consistency and Random Constraint Satisfaction Models with a High Constraint Tightness]''. [https://dblp.uni-trier.de/db/conf/cp/cp2004.html CP 2004] <ref>[https://en.wikipedia.org/wiki/Constraint_satisfaction_problem Constraint satisfaction problem from Wikipedia]</ref> | + | * [[Mathematician#YongGao|Yong Gao]], [[Joe Culberson]] ('''2004'''). ''[https://link.springer.com/chapter/10.1007/978-3-540-30201-8_5 Consistency and Random Constraint Satisfaction Models with a High Constraint Tightness]''. [https://dblp.uni-trier.de/db/conf/cp/cp2004.html CP 2004] <ref>[https://en.wikipedia.org/wiki/Constraint_satisfaction_problem Constraint satisfaction problem from Wikipedia]</ref> |
| − | * [[Yong Gao]], [[Joe Culberson]] ('''2007'''). ''Consistency and Random Constraint Satisfaction Models''. [https://en.wikipedia.org/wiki/Journal_of_Artificial_Intelligence_Research JAIR], Vol. 28, [https://arxiv.org/abs/1110.2204 arXiv:1110.2204] | + | * [[Mathematician#YongGao|Yong Gao]], [[Joe Culberson]] ('''2007'''). ''Consistency and Random Constraint Satisfaction Models''. [https://en.wikipedia.org/wiki/Journal_of_Artificial_Intelligence_Research JAIR], Vol. 28, [https://arxiv.org/abs/1110.2204 arXiv:1110.2204] |
* [[Fan Yang]], [[Joe Culberson]], [[Robert Holte]], [[Uzi Zahavi]], [[Ariel Felner]] ('''2008'''). ''A General Theory of Additive State Space Abstractions''. [https://en.wikipedia.org/wiki/Journal_of_Artificial_Intelligence_Research JAIR], Vol. 32, [https://arxiv.org/abs/1111.0067 arXiv:1111.0067] | * [[Fan Yang]], [[Joe Culberson]], [[Robert Holte]], [[Uzi Zahavi]], [[Ariel Felner]] ('''2008'''). ''A General Theory of Additive State Space Abstractions''. [https://en.wikipedia.org/wiki/Journal_of_Artificial_Intelligence_Research JAIR], Vol. 32, [https://arxiv.org/abs/1111.0067 arXiv:1111.0067] | ||
Latest revision as of 11:49, 2 May 2020
Joe Culberson [1]
Joseph C. (Joe) Culberson,
a Canadian computer scientist, and professor at the Department of Computing Science, University of Alberta.
His research interests tends to be a mixture of theoretical analysis and experimental simulation of algorithms and data structures.
It includes binary search trees [2], graph coloring, genetic algorithms [3], and research on various combinatorical and abstract strategy games,
such as Sokoban and Checkers. In winter 1988, Joe Culberson and Duane Szafron asked Jonathan Schaeffer
the innocent question "Jonathan, what ever happened to computer checkers?" [4], yielding in the development of Chinook, and solving Checkers [5].
He developed the first version of the Chinook endgame database code [6] .
Contents
Selected Publications
1984 ...
- Joe Culberson (1984). Updating Binary Trees. M.Sc. thesis, University of Waterloo
- Joe Culberson (1985). The Effect of Updates in Binary Search Trees. STOC 1985
- Joe Culberson (1986). The Effect of Asymmetric Deletions on Binary Research Trees. Ph.D. thesis, University of Waterloo, advisor J. Ian Munro
- Ricardo Baeza-Yates, Joe Culberson, Gregory J. E. Rawlins (1988). Searching with Uncertainty (Extended Abstract). SWAT 1988
- Joe Culberson, Piotr Rudnicki (1989). A Fast Algorithm for Constructing Trees from Distance Matrices. Information Processing Letters, Vol. 30
- Joe Culberson, J. Ian Munro (1989). Explaining the Behaviour of Binary Search Trees Under Prolonged Updates: A Model and Simulations. The Computer Journal, Vol. 32, No. 1
1990 ...
- Joe Culberson, J. Ian Munro (1990). Analysis of the Standard Deletion Algorithms in Exact Fit Domain Binary Search Trees. Algorithmica, Vol. 5, No. 3
- Jonathan Schaeffer, Joe Culberson, Norman Treloar, Brent Knight, Paul Lu, Duane Szafron (1991). Checkers Program to Challenge for World Championship. SIGART Bulletin, Vol. 2, No. 2
- Jonathan Schaeffer, Joe Culberson, Norman Treloar, Brent Knight, Paul Lu, Duane Szafron (1991). Reviving the Game of Checkers. Heuristic Programming in AI 2
- Jonathan Schaeffer, Joe Culberson, Norman Treloar, Brent Knight, Paul Lu, Duane Szafron (1992). A World Championship Caliber Checkers Program. Artificial Intelligence, Vol. 53, Nos. 2-3, pdf preprint
- Mark Brockington, Joe Culberson (1993). Camouflaging independent sets in quasi-random graphs. Cliques, Coloring, and Satisfiability 1993
- Joe Culberson, Jonathan Schaeffer (1996). Searching with Pattern Databases. Canadian Conference on AI 1996,
- Basil Vandegriend, Joe Culberson (1998). The Gn, m Phase Transition is Not Hard for the Hamiltonian Cycle Problem. JAIR, Vol. 9, arXiv:1105.5443 [9]
- Joe Culberson (1998). On the Futility of Blind Search: An Algorithmic View of "No Free Lunch". Evolutionary Computation, Vol. 6, No. 2 [10]
- Joe Culberson, Jonathan Schaeffer (1998). Pattern databases. Computational Intelligence, Vol. 14, No. 3, pdf
2000 ...
- Yong Gao, Joe Culberson (2002). An Analysis of Phase Transition in NK Landscapes. JAIR, Vol. 17, arXiv:1106.4575 [11]
- Yong Gao, Joe Culberson (2004). Consistency and Random Constraint Satisfaction Models with a High Constraint Tightness. CP 2004 [12]
- Yong Gao, Joe Culberson (2007). Consistency and Random Constraint Satisfaction Models. JAIR, Vol. 28, arXiv:1110.2204
- Fan Yang, Joe Culberson, Robert Holte, Uzi Zahavi, Ariel Felner (2008). A General Theory of Additive State Space Abstractions. JAIR, Vol. 32, arXiv:1111.0067
External Links
- Joseph (Joe) Culberson Professor
- Joe Culberson's ICGA Tournaments
- Joseph Culberson's Graph Coloring Resources Page
- Joseph Culberson - The Mathematics Genealogy Project
References
- ↑ Authors - Chinook
- ↑ Joseph Culberson's Binary Search Tree Research
- ↑ Joseph Culberson Research Interests
- ↑ Jonathan Schaeffer (1997, 2009). One Jump Ahead. 1. This Was Going to Be Easy, pp. 5
- ↑ Chinook - Solving Checkers
- ↑ Authors - Chinook
- ↑ Joseph Culberson's Publications List
- ↑ dblp: Joseph C. Culberson
- ↑ Hamiltonian path problem from Wikipedia
- ↑ No free lunch in search and optimization | Wikipedia
- ↑ NK model from Wikipedia
- ↑ Constraint satisfaction problem from Wikipedia
