A parallel algorithm for solving the n-queens problem based on inspired computational model

Biosystems ◽  
2015 ◽  
Vol 131 ◽  
pp. 22-29 ◽  
Author(s):  
Zhaocai Wang ◽  
Dongmei Huang ◽  
Jian Tan ◽  
Taigang Liu ◽  
Kai Zhao ◽  
...  
Keyword(s):  
Computational Model ◽  
Parallel Algorithm

scholarly journals AN OPTIMAL PARALLEL ALGORITHM FOR DETECTING WEAK VISIBILITY OF A SIMPLE POLYGON

1995 ◽  
Vol 05 (01n02) ◽  
pp. 93-124 ◽  
Author(s):  
DANNY Z. CHEN
Keyword(s):  
Computational Model ◽  
Parallel Algorithm ◽  
Simple Polygon ◽  
Sequential Algorithms ◽  
Crew Pram

The problem of detecting the weak visibility of an n-vertex simple polygon P is that of finding whether P is weakly visible from one of its edges and (if it is) identifying every edge from which P is weakly visible. In this paper, we present an optimal parallel algorithm for solving this problem. Our algorithm runs in O(log n) time using O(n/log n) processors in the CREW PRAM computational model, and is very different from the sequential algorithms for this problem. Based on this algorithm, several other problems related to weak visibility can be optimally solved in parallel.

Determining Weak Visibility of a Polygon from an Edge in Parallel

1998 ◽  
Vol 08 (03) ◽  
pp. 277-304
Author(s):  
Danny Z. Chen
Keyword(s):  
Computational Model ◽  
Parallel Algorithm ◽  
Simple Polygon ◽  
Sequential Algorithms ◽  
Simple Polygons ◽  
Crew Pram

The problem of determining the weak visibility of an n-vertex simple polygon P from an edge e of P is that of deciding whether every point in P is weakly visible from e. In this paper we present an optimal parallel algorithm for solving this problem. Our algorithm runs in O( log n) time using O(n/ log n) processors in the CREW PRAM computational model, and is very different from the sequential algorithms for this problem. We also show how to solve optimally, in parallel, several other problems that are related to the weak visibility of simple polygons.

PARALLEL ALGORITHMS FOR LONGEST INCREASING CHAINS IN THE PLANE AND RELATED PROBLEMS

1999 ◽  
Vol 09 (04) ◽  
pp. 511-520 ◽  
Author(s):  
MIKHAIL J. ATALLAH ◽  
DANNY Z. CHEN ◽  
KEVIN S. KLENK
Keyword(s):  
Parallel Algorithms ◽  
Computational Model ◽  
Parallel Algorithm ◽  
Related Problem ◽  
Single Source ◽  
Crew Pram ◽  
Longest Paths ◽  
Nonnegative Weight

Given a set [Formula: see text] of n points in the plane such that each point in [Formula: see text] is asscociated with a nonnegative weight, we consider the problem of computing the single-source longest increasing chains among the points in [Formula: see text] This problem is a generalization of the plannar maximal layers problem. In this paper, we present a parallel algorithm that computes the single-source longest incresing chains in the plane in [Formula: see text] time using [Formula: see text] processors in the CREW PRAM computational model. We also solve a related problem of computing the all-pairs longest paths in an n-node weighted planar st-graph, in [Formula: see text] time using [Formula: see text] CREW PRAM processors. Both of our parallel algorithms are improvement over the previously best known results.

Inference making and memory for text: A computational model

2001 ◽  
Author(s):  
Paul Van Den Broek ◽  
Yuhtsuen Tzeng ◽  
Sandy Virtue ◽  
Tracy Linderholm ◽  
Michael E. Young
Keyword(s):  
Computational Model ◽  
Inference Making ◽  
Memory For Text

Computational Model of Novel Popout

1992 ◽  
Author(s):  
William A. Johnston ◽  
Kevin J. Hawley ◽  
James M. Farnham
Keyword(s):  
Computational Model
Sign in / Sign up

Export Citation Format

Share Document