Results 1 to 10 of about 98,329 (103)
On separating the EREW and CREW PRAM models [PDF]
Theoretical Computer Science, 1989 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Prabhakar Ragde +2 more
exaly +3 more sources
Optimal Parallel Two Dimensional Text Searching on a CREW PRAM [PDF]
Information and Computation, 1998 In this paper, the efficient parallel algorithm for two dimensional pattern matching over a general alphabet is presented. The text processing phase is optimal in that its work is linear and its running time is optimal; i.e., it matches the lower bound \(O(\log m)\) for CREW PRAMs, where \(m\) is the length of the longest dimension of the pattern ...
Amihood Amir +2 more
exaly +3 more sources
Connected Components inO(log3/2n) Parallel Time for the CREW PRAM [PDF]
Journal of Computer and System Sciences, 1997 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Donald B. Johnson 0001 +1 more
exaly +6 more sources
Time lower bounds for CREW-PRAM computation of monotone functions [PDF]
, 1989 It is shown that the time to compute a monotone boolean function depending upon n variables on a CREW-PRAM satisfies the lower bound T=Θ(logl+(log n)/l), where l is the size of the largest prime implicant. It is also shown that the bound is existentially tight by constructing a family of monotone functions that can be computed in T=O(log l+(log n)/l ...
Bilardi, Gianfranco, Moitra, Abha
core +9 more sources
Application of Fuzzy Optimization to the Orienteering Problem
Advances in Fuzzy Systems, 2015 This paper deals with the orienteering problem (OP) which is a combination of two well-known problems (i.e., travelling salesman problem and the knapsack problem).
Madhushi Verma, K. K. Shukla
doaj +2 more sources
SIAM Journal on Computing, 1993 The universality of the Parallel Random-Access Machines is usually defined by simulating universal Turing machines or boolean networks. These definitions are well-suited if we are interested in evaluating the complexity of algorithms but it is not as good if we want to deal with computability.
Joachim von zur Gathen +1 more
+8 more sources
Separating the Power of EREW and CREW PRAMs with Small Communication Width
Information and Computation, 1993 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Paul Beame +2 more
openaire +3 more sources
An Optimal Parallel Algorithm for the Longest Common Subsequence Problem on CREW-PRAM Model
, 2021 A subsequence of a given string is any string obtained by deleting none or some symbols from the given string. A longest common subsequence of two strings is a common subsequence of both that is as long as any other common subsequences. The longest commons subsequence problem is to find a longest common subsequence of two given strings.
openaire +1 more source
A cost optimal parallel algorithm for computing force field in N-body simulations on a CREW PRAM
Theoretical Computer Science, 2001 We consider the following force field computation problem: given a cluster of \(n\) particles in three-dimensional space, compute the force exerted on each particle by the other particles. Depending on different applications, the pairwise interaction could be either gravitational or Lennard-Jones. In both cases, the force between two particles vanishes
openaire +3 more sources
Optimizing human performance in extreme environments through precision medicine: From spaceflight to high-performance operations on Earth. [PDF]
Camb Prism Precis Med, 2023 Schmidt MA, Jones JA, Mason CE.
europepmc +1 more source