Difference between revisions of "Joe Culberson"

From Chessprogramming wiki
Jump to: navigation, search
(Created page with "'''Home * People * Joe Culberson''' FILE:joeculberson.jpg|border|right|thumb|link=http://webdocs.cs.ualberta.ca/%7Echinook/authors/| Joe Culberson <ref>[...")
 
Line 31: Line 31:
 
* [[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]
  

Revision as of 10:40, 2 May 2020

Home * People * Joe Culberson

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] .

Selected Publications

[7] [8]

1984 ...

1990 ...

2000 ...

External Links

References

Up one level