Iterative versionspaces

, &
Artificial Intelligence 69 (1-2):393-409 (1994)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/0004-3702(94)90090-6

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,069

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Learning logic programs with structured background knowledge☆☆An extended abstract of this paper appeared in: L. De Raedt (Ed.), Proceedings of the Fifth International Workshop on Inductive Logic Programming, Tokyo, Japan, 1995, pp. 53–76, Scientific Report of the Department of Computer Science, Katholieke Universiteit Leuven, and also in the post-conference volume: L. De Raedt (Ed.), Advances in Inductive Logic Programming, IOS Press, Amsterdam/Ohmsha, Tokyo, 1996, pp. 172–191. [REVIEW]Tamás Horváth & György Turán - 2001 - Artificial Intelligence 128 (1-2):31-97.
Iterative broadening.Matthew L. Ginsberg & William D. Harvey - 1992 - Artificial Intelligence 55 (2-3):367-383.
Time complexity of iterative-deepening-A∗.Richard E. Korf, Michael Reid & Stefan Edelkamp - 2001 - Artificial Intelligence 129 (1-2):199-218.
Iterative voting and acyclic games.Reshef Meir, Maria Polukarov, Jeffrey S. Rosenschein & Nicholas R. Jennings - 2017 - Artificial Intelligence 252 (C):100-122.
Iterative Voting with Partial Preferences.Zoi Terzopoulou, Panagiotis Terzopoulos & Ulle Endriss - forthcoming - Artificial Intelligence.
Depth-first iterative-deepening.Richard E. Korf - 1985 - Artificial Intelligence 27 (1):97-109.
Agent searching in a tree and the optimality of iterative deepening.Pallab Dasgupta, P. P. Chakrabarti & S. C. DeSarkar - 1994 - Artificial Intelligence 71 (1):195-208.
Iterative genetic improvement: Scaling stochastic program synthesis.Yuan Yuan & Wolfgang Banzhaf - 2023 - Artificial Intelligence 322 (C):103962.
Iterative state-space reduction for flexible computation.Weixiong Zhang - 2001 - Artificial Intelligence 126 (1-2):109-138.
A correction to “Agent searching in a tree and the optimality of iterative deepening”.Pallab Dasgupta, P. P. Chakrabarti & S. C. DeSarkar - 1995 - Artificial Intelligence 77 (1):173-176.

Analytics

Added to PP
2020-12-22

Downloads
6 (#1,484,355)

6 months
3 (#1,046,495)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

Depth-first iterative-deepening.Richard E. Korf - 1985 - Artificial Intelligence 27 (1):97-109.
Generalization as search.Tom M. Mitchell - 1982 - Artificial Intelligence 18 (2):203-226.
The description identification problem.Chris Mellish - 1991 - Artificial Intelligence 52 (2):151-167.

Add more references