25,161
edits
Changes
no edit summary
* [[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],
* [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]], [[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 ...==
* [[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>* [[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>* [[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]
