Depth-first iterative-deepening: an optimal admissible tree search
Artificial Intelligence
A Randomized Parallel Backtracking Algorithm
IEEE Transactions on Computers
Explanation-based learning: a problem solving perspective
Artificial Intelligence
Artificial Intelligence
Do the right thing: studies in limited rationality
Do the right thing: studies in limited rationality
Single-Agent Parallel Window Search
IEEE Transactions on Pattern Analysis and Machine Intelligence
On the Efficiency of Parallel Backtracking
IEEE Transactions on Parallel and Distributed Systems
Superlinear Speedup in Parallel State-Space Search
Proceedings of the Eighth Conference on Foundations of Software Technology and Theoretical Computer Science
Autonomous Agents and Multi-Agent Systems
Easy and hard testbeds for real-time search algorithms
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Using vision and coordination to find unknown target
ICCOMP'06 Proceedings of the 10th WSEAS international conference on Computers
Applying coordination in moving target search (MTS) algorithm
ICCOMP'06 Proceedings of the 10th WSEAS international conference on Computers
C3LRTA*, color code coordinated LRTA* algorithm
CIMMACS'05 Proceedings of the 4th WSEAS international conference on Computational intelligence, man-machine systems and cybernetics
Propagating updates in real-time search: HLRTA (k)
CAEPIA'05 Proceedings of the 11th Spanish association conference on Current Topics in Artificial Intelligence
Avoiding and escaping depressions in real-time heuristic search
Journal of Artificial Intelligence Research
Hi-index | 0.00 |
The problem of finding a set of assumptions which explain a given proposition is in general NP-hard, even when the background theory is an acyclic Horn theory. In this paper it is shown that when the background theory is acyclic Horn and its pseudo-completion ...