Results 41 to 50 of about 98,549 (74)
Some of the next articles are maybe not open access.
Connected components in O(lg/sup 3/2 mod V/ mod ) parallel time for the CREW PRAM
[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science, 1991Computing the connected components of an undirected graph G=(V, E) on mod V mod =n vertices and mod E mod =m edges is addressed. An efficient and simple algorithm that runs in O(lg/sup 3/2/ n) time using n+m CREW processors is presented. >
Donald B. Johnson, P. Metaxas
semanticscholar +2 more sources
Parallel Algorithms for Some Dominance Problems Based on a CREW PRAM
International Symposium on Algorithms, 1991Two parallel geometric algorithms based on the idea of point domination are presented. The first algorithm solves the d-dimensional isothetic rectangles intersection counting problem of input size N/2d, where d > 1 and N is a multiple of 2d, in O(logd−1N) time and O(N) space.
I. Chan, D. K. Friesen
semanticscholar +2 more sources
Journal of Heuristics, 2019
Non-dominated sorting is a crucial component of Pareto-based multi- and many-objective evolutionary algorithms. As the number of objectives increases, the execution time of a multi-objective evolutionary algorithm increases, too. Since multi-objective evolutionary algorithms normally have a low data dependency, research-ers have increasingly adopted ...
S. Mishra, C. A. Coello Coello
semanticscholar +2 more sources
Non-dominated sorting is a crucial component of Pareto-based multi- and many-objective evolutionary algorithms. As the number of objectives increases, the execution time of a multi-objective evolutionary algorithm increases, too. Since multi-objective evolutionary algorithms normally have a low data dependency, research-ers have increasingly adopted ...
S. Mishra, C. A. Coello Coello
semanticscholar +2 more sources
2019 IEEE Congress on Evolutionary Computation (CEC), 2019
In the current paper we focus on parallelization of non-dominated sorting which is an essential step in Pareto-based multi-objective evolutionary algorithms.
S. Mishra, C. Coello
semanticscholar +2 more sources
In the current paper we focus on parallelization of non-dominated sorting which is an essential step in Pareto-based multi-objective evolutionary algorithms.
S. Mishra, C. Coello
semanticscholar +2 more sources
Efficient geometric algorithms on the EREW PRAM
IEEE Transactions on Parallel and Distributed Systems, 1995D Z Chen
exaly +2 more sources
On Separating the EREW and CREW PRAM Models,
1988Prabhakar Ragde, Joseph Naor, Eli Gafni
exaly +2 more sources
An insight on PRAM computational bounds
Information Processing Letters, 1997Linda Pagli
exaly +2 more sources
Efficient PRAM and Practical GPU Algorithms for Large Polygon Clipping with Degenerate Cases
IEEE/ACM International Symposium on Cluster, Cloud and Internet Computing, 2023Polygonal geometric operations are fundamental in domains such as Computer Graphics, Computer-Aided Design, and Geographic Information Systems. Handling degenerate cases in such operations is important when real-world spatial data are used.
Buddhi Ashan, S. Puri, S. Prasad
semanticscholar +1 more source
Retrieval of scattered information by EREW, CREW, and CRCW PRAMs
Computational Complexity, 1992zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Faith E. Fich +4 more
openaire +1 more source
Time Complexity of Boolean Functions on CREW PRAM
This paper is concerned with parallel random access machines (PRAMS), where each processor can read from and write into a common random access memory.
openaire +1 more source