Zobrazeno 1 - 10
of 48
pro vyhledávání: '"Culberson, Joseph"'
Publikováno v:
Journal Of Artificial Intelligence Research, Volume 32, pages 631-662, 2008
Informally, a set of abstractions of a state space S is additive if the distance between any two states in S is always greater than or equal to the sum of the corresponding distances in the abstract spaces. The first known additive abstractions, call
Externí odkaz:
http://arxiv.org/abs/1111.0067
Autor:
Gao, Yong, Culberson, Joseph
Publikováno v:
In Electronic Notes in Discrete Mathematics 2003 16:15-20
Autor:
Culberson, Joseph, Gent, Ian *
Publikováno v:
In Theoretical Computer Science 2001 265(1):227-264
Autor:
Yong Gao1 ygao@cs.ualberta.ca, Culberson, Joseph1 joe@cs.ualberta.ca
Publikováno v:
Evolutionary Computation. Spring2005, Vol. 13 Issue 1, p125-143. 19p. 2 Diagrams.
Publikováno v:
Computational Intelligence. Aug98, Vol. 14 Issue 3, p318. 17p.
Autor:
Culberson, Joseph C.
Publikováno v:
Evolutionary Computation. Summer98, Vol. 6 Issue 2, p109. 19p.
Publikováno v:
Education and Research Archive.
Technical report TR07-06. The effectiveness of heuristics search is influnced by the accuracy of the heuristic values. State space abstractions have been proved to be effective for generating admissible heuristics. In this paper, A general definition
Autor:
Culberson, Joseph
Publikováno v:
Education and Research Archive.
Technical report TR96-18. This paper might have been subtitled \"An algorithmicist looks at no free lunch.\" We use simple adversary arguments to redevelop and explore some of the no free lunch (NFL) theorems and perhaps extend them a little. A secon
Autor:
Culberson, Joseph, Schaeffer, Jonathan
Technical report TR94-08. The A* algorithm for single-agent search has attracted considerable attention in recent years due to Korf's iterative deepening improvement (IDA*). The algorithm's efficiency depends on the quality of the lower bound estimat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::201e929256657e1401b36105f37870c9
Autor:
Culberson, Joseph, Evans, Patricia
Technical report TR94-09. In this paper we explore the relationship between asymmetries in deletion algorithms used in updating binary search trees, and the resulting long term behavior of the search trees. We show that even what would appear to be n
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::15e82666553418a88b73a5c5a364d35a