Add to ORKGThis report describes my implementation of a parallel iterative-deepening A* search algorithm on a NCUBE parallel computer. I present a detailed description of the algorithm, followed by a discussion of its theoretical performance. The actual performance of my implementation is compared to the theoretical model, and a summary of the results is presented
In this paper, a distributed heuristic search algorithm is presented. We show that the algorithm is ...
Many problems in Artificial Intelligence involve traversing large search-spaces. Such problems typic...
eaburns at cs.unh.edu and ruml at cs.unh.edu Abstract. The memory requirements of best-first graph s...
This report describes my implementation of a parallel iterative-deepening A* search algorithm on a N...
The present paper discusses the implementation of the discrete search optimization techniques on a p...
Many of the artificial intelligence techniques developed to date rely on heuristic search through la...
The Iterative Deepening A* (IDA*) (R.E. Korf, Artificial Intelligence 27 (1985)) algorithm often ree...
Abstract: Here we want to represent an introduction about searching algorithms. Due to this, first w...
We consider the problem of parallelizing restarted backtrack search. With few notable exceptions, mo...
The increasing availability of “utility computing” resources such as clouds, grids, and massively pa...
Parallel heuristic search algorithms are widely used in artificial intelligence. This paper describe...
Search is an important aspect of Artificial Intelligence and many advances have been achieved in fin...
This paper presents many different parallel for-mulations of the A*/Branch-and-Bound search algorith...
PhDElectrical engineeringUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://...
Sorting and hashing are canonical index-based methods to perform searching, and are often sub-routin...
In this paper, a distributed heuristic search algorithm is presented. We show that the algorithm is ...
Many problems in Artificial Intelligence involve traversing large search-spaces. Such problems typic...
eaburns at cs.unh.edu and ruml at cs.unh.edu Abstract. The memory requirements of best-first graph s...
This report describes my implementation of a parallel iterative-deepening A* search algorithm on a N...
The present paper discusses the implementation of the discrete search optimization techniques on a p...
Many of the artificial intelligence techniques developed to date rely on heuristic search through la...
The Iterative Deepening A* (IDA*) (R.E. Korf, Artificial Intelligence 27 (1985)) algorithm often ree...
Abstract: Here we want to represent an introduction about searching algorithms. Due to this, first w...
We consider the problem of parallelizing restarted backtrack search. With few notable exceptions, mo...
The increasing availability of “utility computing” resources such as clouds, grids, and massively pa...
Parallel heuristic search algorithms are widely used in artificial intelligence. This paper describe...
Search is an important aspect of Artificial Intelligence and many advances have been achieved in fin...
This paper presents many different parallel for-mulations of the A*/Branch-and-Bound search algorith...
PhDElectrical engineeringUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://...
Sorting and hashing are canonical index-based methods to perform searching, and are often sub-routin...
In this paper, a distributed heuristic search algorithm is presented. We show that the algorithm is ...
Many problems in Artificial Intelligence involve traversing large search-spaces. Such problems typic...
eaburns at cs.unh.edu and ruml at cs.unh.edu Abstract. The memory requirements of best-first graph s...