MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "Depth-First Iterative-Deepening An Optimal Admissible Tree Search." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

3 documents found, showing 1 through 3.

ATOM

Depth-first Iterative-Deepening: An Optimal Admissible Tree Search
by Richard E. Korf — 1985 — Artificial Intelligence
…! i i i z Depth-First Iterative-Deepening: An Optimal Admissible Tree Search* Richard E. Korf…
Cited by 281 (10 self) – Add To MetaCart

Model-Based Learning of Interaction Strategies in Multi-Agent Systems
by David Carmel, In Milind Tambe, Piotr Gmytrasiewicz, Aaai- Workshop, B. Trakhtenbrot, Y. Barzdin, Finite Automata Behavior, Synthesis North Holl, Michael J. Wooldrige, Dana Ron, Ronitt Rubinfeled, Exactly In — 1997
…. [58] R. E. Korf. Depth-first iterative deepening: An optimal admissible tree search. Artificial…
Cited by 15 (4 self) – Add To MetaCart

Zilberstein and Russell, 1992d] S. Zilberstein and S. J. Russell. Constructing utility-driven real-time systems
by Computation Pp Phoenix, K. P. Smith, Vrbsky Et Al, S. V. Vrbsky, J. W. S. Liu
… iterative-deepening: An optimal admissible tree search. Artificial Intelligence 27: 97–109, 1985. [Korf…
Add To MetaCart

Showing 1 through 3.

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB