278 citations found. Retrieving documents...
Richard E. Korf. Depth-first iterative-deepening: An optimal admissible tree search. Artificial Intelligence, 27(1):97--109, 1985. 193

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:

First 50 documents  Next 50

Automatically Generating Abstractions for Problem Solving - Knoblock (1991)   (56 citations)  (Correct)

No context found.

Richard E. Korf. Depth-first iterative-deepening: An optimal admissible tree search. Artificial Intelligence, 27(1):97--109, 1985. 193


Washington - University In St   (Correct)

No context found.

R. E. Korf. Depth-first iterative-deepening: an optimal admissible tree search. Artificial Intelligence, 27(1):97--109, 1985.


Search Reduction in Hierarchical Problem Solving - Knoblock (1991)   (43 citations)  (Correct)

No context found.

Richard E. Korf. Depth-first iterativedeepening: An optimal admissible tree search. Artificial Intelligence, 27(1):97--109, 1985.


Action Planning for Graph Transition Systems - Edelkamp, Jabbar, al. (2005)   (Correct)

No context found.

Korf, R. E. 1985. Depth-first iterative-deepening: An optimal admissible tree search. Artificial Intelligence 27(1):97--109.


Accelerating Heuristic Search in Spatial Domains - Stefan Edelkamp Shahid (2003)   (Correct)

No context found.

R. E. Korf. Depth-first iterative-deepening: An optimal admissible tree search. Artificial Intelligence, 27(1):97--109, 1985.


Cost-Algebraic Heuristic Search - Stefan Edelkamp And (2005)   (Correct)

No context found.

Korf, R. E. 1985. Depth-first iterative-deepening: An optimal admissible tree search. Artificial Intelligence 27(1):97--109.


External Program Model Checking - Stefan Edelkamp Shahid   (Correct)

No context found.

R. E. Korf. Depth-first iterative-deepening: An optimal admissible tree search. Artificial Intelligence, 27(1):97--109, 1985.


Design and Implementation of a Hybrid Energy.. - Li, Pottharst..   (Correct)

No context found.

R. E. Korf, "Depth-first iterative-deepening: An optimal admissible tree search", Artificial Intelligence, Vol. 33, No 1, pp 65-88, 1987.


Context-Centric Needs Anticipation Using Information Needs.. - Fan, Wang, Sun, Yen, Al. (2006)   (Correct)

No context found.

K.E. Korf, "Depth-first iterative deepening: An optimal admissible tree search," Artificial Intelligence,vol. 27, no. 1, pp. 97--109, 1985.


Context-Centric Needs Anticipation Using - Information Needs Graphs   (Correct)

No context found.

K. E. Korf, "Depth-first iterative deepening: an optimal admissible tree search," Artificial Intelligence, vol. 27, no. 1, pp. 97--109, 1985.


Visualizing Object And Method Granularity For Program - Parallelization William Hui (2000)   (Correct)

No context found.

R. Korf, "Depth-First Iterative Deepening: An Optimal Admissible Tree Search", Artificial Intelligence, 27(1):97-109, 1985.


Directed Explicit-State Model Checking in the.. - Edelkamp, Leue.. (2002)   (3 citations)  (Correct)

No context found.

R. E. Korf. Depth-first iterative-deepening: An optimal admissible tree search. International Joint Conference on Artificial Intelligence (IJCAI), 27(1):97--109, 1985.


Directed Explicit-State Model Checking in the.. - Edelkamp, Leue.. (2004)   (3 citations)  (Correct)

No context found.

Korf, R.E.: Depth-first iterative-deepening: An optimal admissible tree search. International Joint Conference on Artificial Intelligence (IJCAI), 27(1): 97--109, 1985


Partial Order Reduction in Directed Model Checking - Lluch-Lafuente, Edelkamp, Leue (2001)   (Correct)

No context found.

R. E. Korf. Depth-first iterative-deepening: An optimal admissible tree search. Artificial Intelligence, 27(1):97--109, 1985.


Flexibility in Statically Scheduled Hard Real-Time Systems - Fohler (1994)   (9 citations)  (Correct)

No context found.

R. Korf. Depth-First Iterative-Deepening: An Optimal Admissable Tree Search. Artificial Intelligence, 27(3):97--109, 1985.


An Efficient Projected Minimal Conflict Generator for Projected.. - Elliott (2004)   (Correct)

No context found.

Richard E. Korf. Depth-first iterative-deepening: an optimal admissible tree search. Artif. Intell., 27(1):97--109, 1985.


Directed Search for the Verification of Communication Protocols - Lafuente (2003)   (Correct)

No context found.

R. E. Korf. Depth-first iterative-deepening: An optimal admissible tree search. Artificial Intelligence, 27(1):97--109, 1985.


An Efficient Projected Minimal Conflict Generator for Projected.. - Elliott (2004)   (Correct)

No context found.

Richard E. Korf. Depth-first iterative-deepening: an optimal admissible tree search. Artif. Intell., 27(1):97--109, 1985.


Probabilistic conflicts in a search algorithm for estimating.. - Poole (1996)   (4 citations)  (Correct)

No context found.

K. E. Korf. Depth-first iterative deepening: an optimal admissible tree search. Artificial Intelligence, 27(1):97--109, September 1985.


Tool Support for Logics of Programs - Paulson (2002)   (Correct)

No context found.

R. E. Korf. Depth-first iterative-deepening: an optimal admissible tree search. Artificial Intelligence, 27:97--109, 1985.


Promela Planning - Edelkamp (2003)   (2 citations)  (Correct)

No context found.

R. E. Korf. Depth-first iterative-deepening: An optimal admissible tree search. Artificial Intelligence, 27(1):97--109, 1985.


Foundations of Computer - Science Computer Science (2002)   (Correct)

No context found.

R. E. Korf. Depth-first iterative-deepening: an optimal admissible tree search. Artificial Intelligence, 27:97--109, 1985.


ADOPT: Asynchronous Distributed Constraint Optimization.. - Modi, Shen, Tambe, Yokoo (2004)   (4 citations)  (Correct)

No context found.

Richard E. Korf. Depth-first iterative-deepening: an optimal admissible tree search. Artificial Intelligence, 27(1):97--109, 1985.


Efficient BDD-Based Planning for Non-Deterministic.. - Jensen (2003)   (Correct)

No context found.

R. E. Korf. Depth-first iterative-deepening: An optimal admissible tree search. Artificial Intelligence, 27(1):97--109, 1985.


Real-Time Search for Autonomous Agents and Multiagent Systems - Ishida (1998)   (3 citations)  (Correct)

No context found.

R. E. Korf, "Depth-first Iterative-Deepening: An Optimal Admissible Tree Search," Artificial Intelligence, vol. 27#1, pp. 97#109, 1985.

First 50 documents  Next 50

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC