Results 1  10
of
1,583,027
The APHID Parallel Search Algorithm
, 1996
"... This paper introduces the APHID (Asynchronous Parallel Hierarchical Iterative Deepening) gametree search algorithm. APHID represents a departure from the approaches used in practice. Instead of parallelism based on the minimal search tree, APHID uses a truncated gametree and all of the leaves of th ..."
Abstract
 Add to MetaCart
This paper introduces the APHID (Asynchronous Parallel Hierarchical Iterative Deepening) gametree search algorithm. APHID represents a departure from the approaches used in practice. Instead of parallelism based on the minimal search tree, APHID uses a truncated gametree and all of the leaves
A Parallel Search Algorithm for the SAT
, 2005
"... In order to be able to perform multimedia searches (like sounds, videos, images, etc.) we have to use data structures like the Spatial Approximation Tree (SAT). This structure is a nice example of a tree structure in which wellknown tricks for tree parallelization simply do not work. It is too spar ..."
Abstract
 Add to MetaCart
In order to be able to perform multimedia searches (like sounds, videos, images, etc.) we have to use data structures like the Spatial Approximation Tree (SAT). This structure is a nice example of a tree structure in which wellknown tricks for tree parallelization simply do not work. It is too
Parallel Search Algorithms for Robot Motion Planning
 In Proceedings of the 1993 IEEE International Conference on Robotics and Automation, 4651. Los Alamitos
, 1993
"... In this paper we show that parallel search techniques derived from their sequential counterparts can enable the solution of instances of the robot motion planning problem that are computationally infeasible on sequential machines. We present a simple parallel version of a robot motion planning algor ..."
Abstract

Cited by 44 (6 self)
 Add to MetaCart
In this paper we show that parallel search techniques derived from their sequential counterparts can enable the solution of instances of the robot motion planning problem that are computationally infeasible on sequential machines. We present a simple parallel version of a robot motion planning
Concept and Design of ExhaustiveParallel search algorithm for NetworkonChip
"... Abstract: This paper presents the concept and design of exhaustiveparallel search algorithm for NetworkonChip. The proposed parallel algorithm searches minimal path between source and destination in a forwardwavepropagation manner. The algorithm guarantees setup latency if the setup path exists. ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract: This paper presents the concept and design of exhaustiveparallel search algorithm for NetworkonChip. The proposed parallel algorithm searches minimal path between source and destination in a forwardwavepropagation manner. The algorithm guarantees setup latency if the setup path exists
ALPS: A framework for implementing parallel search algorithms
 In Proceedings of the Ninth INFORMS Computing Society Conference
, 2005
"... ALPS is a framework for implementing and parallelizing tree search algorithms. It employs a number of features to improve scalability and is designed specifically to support the implementation of data intensive algorithms, in which large amounts of knowledge are generated and must be maintained and ..."
Abstract

Cited by 19 (7 self)
 Add to MetaCart
ALPS is a framework for implementing and parallelizing tree search algorithms. It employs a number of features to improve scalability and is designed specifically to support the implementation of data intensive algorithms, in which large amounts of knowledge are generated and must be maintained
A Parallel Search Algorithm for the NQueens Problem
 IEEE Transactions on Systems, Man, and Cybernetics
, 1991
"... The Nqueens problem is to place n queens on an n \Theta n chessboard such that no two queens attack each other. This problem is commonly used as a benchmark for algorithms that solve constraint satisfaction problems (CSP). This paper describes a novel parallel algorithm for the Nqueens problem. Th ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
. The algorithm finds a solution by performing a probabilistic parallel search. By using n processors, its running time is O(log 2 n). The algorithm demonstrates a new practical approach to tackle large scale CSP on parallel computers. 1 Introduction The Nqueens problem is to place n queens on an n \Theta n
A Parallel Search Algorithm for the NQueens Problem
 IEEE Transactions on Systems, Man, and Cybernetics
, 1991
"... The Nqueens problem is to place n queens on an n \Theta n chessboard such that no two queens attack each other. This problem is commonly used as a benchmark for algorithms that solve constraint satisfaction problems (CSP). This paper describes a novel parallel algorithm for the Nqueens problem. ..."
Abstract
 Add to MetaCart
. The algorithm finds a solution by performing a probabilistic parallel search. By using n processors, its running time is O(log 2 n). The algorithm demonstrates a new practical approach for solving large scale CSP on parallel computers. Keywords: constraint satisfaction, parallel search, local search, n
Parallel Search Algorithm for the Detection of Irregular Structures
"... Introduction The interest in this type of search algorithms originates from the socalled Cluster Algorithm, a nonlocal update procedure in Monte Carlo simulations of spin models [1,2]. The goal of Monte Carlo simulations of spin models is to generate configurations of spins, typical of statistica ..."
Abstract
 Add to MetaCart
Introduction The interest in this type of search algorithms originates from the socalled Cluster Algorithm, a nonlocal update procedure in Monte Carlo simulations of spin models [1,2]. The goal of Monte Carlo simulations of spin models is to generate configurations of spins, typical
A Survey of Parallel Search Algorithms for Discrete Optimization Problems
 ORSA JOURNAL ON COMPUTING
, 1993
"... Discrete optimization problems (DOPs) arise in various applications such as planning, scheduling, computer aided design, robotics, game playing and constraint directed reasoning. Often, a DOP is formulated in terms of finding a (minimum cost) solution path in a graph from an initial node to a goal n ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
node and solved by graph/tree search methods. Availability of parallel computers has created substantial interest in exploring parallel formulations of these graph and tree search methods. This article provides a survey of various parallel search algorithms such as Backtracking, IDA*, A*, Branch
A Library Hierarchy for Implementing Scalable Parallel Search Algorithms
 The Journal of Supercomputing
, 2001
"... This report describes the design of the Abstract Library for Parallel Search (ALPS), a framework for implementing scalable, parallel algorithms based on tree search. ALPS is specically designed to support data intensive algorithms, in which large amounts of data are required to describe each node ..."
Abstract

Cited by 17 (6 self)
 Add to MetaCart
This report describes the design of the Abstract Library for Parallel Search (ALPS), a framework for implementing scalable, parallel algorithms based on tree search. ALPS is specically designed to support data intensive algorithms, in which large amounts of data are required to describe each
Results 1  10
of
1,583,027