Results 31 to 40 of about 127,054 (312)
Fast and accurate RCS evaluation via high-performance parallel FDTD simulation
In this study, a fast and accurate method to predict the radar cross-section (RCS) of large-scale and complicated shape targets is proposed based on a high-performance parallel finite difference time-domain (FDTD) numerical method.
Xiao Long Zhou +3 more
doaj +1 more source
Incomparability in parallel computation
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Vince Grolmusz, Prabhakar Ragde
openaire +1 more source
Parallel visibility computations for parallel radiosity [PDF]
The radiosity method models the interaction of light between diffuse reflecting surfaces, thereby accurately predicting global illumination effects. Due to the high computational effort to calculate the transfer of light between surfaces and the memory requirements for the scene description, a distributed, parallelized verison of the algorithm is ...
Wolfgang Stürzlinger, Christoph Wild
openaire +3 more sources
Programming parallel computers [PDF]
This paper is from a keynote address to the IEEE International Conference on Computer Languages, October 9, 1988. Keynote addresses are expected to be provocative (and perhaps even entertaining), but not necessarily scholarly. The reader should be warned that this talk was prepared with these expectations in mind.Parallel computers offer the potential ...
openaire +2 more sources
An Improved Method for Exon Array Data Analysis
Alternative splicing of genes is usually induced by some severe diseases. Exon array manufactured by Affymetrix Company has been widely used to detect alternative splicing.
S.H. Jin
doaj +1 more source
Supporting tasks with adaptive groups in data parallel programming [PDF]
A set of communication operations is defined, which allows a form of task parallelism to be achieved in a data parallel architecture. The set of processors can be subdivided recursively into groups, and a communication operation inside a group never ...
O'Donnell, J.T.
core +1 more source
Randomized parallel computation [PDF]
The subject of this thesis is randomized parallel algorithms. The goal is to demonstrate the power of randomization in designing efficient parallel algorithms for various computational problems. The specific problems we are concerned with are: sorting, routing, and combinatorial optimization.
Sanguthevar Rajasekaran, John H. Reif
openaire +1 more source
Kernel density estimation (KDE) is a commonly used method for spatial point pattern analysis, but it is computationally demanding when analyzing large datasets. GPU-based parallel computing has been adopted to address such computational challenges.
Guiming Zhang, Jin Xu
doaj +1 more source
Evaluation of sequential, multi-objective, and parallel interactive genetic algorithms for multi-objective optimization problems. [PDF]
We propose a sequential interactive genetic algorithm (IGA), multi-objective IGA and parallel IGA, and evaluate them with both simulated and real users.
Ramsden, Jeremy +10 more
core +1 more source
SPRINT: A new parallel framework for R [PDF]
25.03.14 KB. Ok to add published version to spiral, OA paperBACKGROUND:Microarray analysis allows the simultaneous measurement of thousands to millions of genes or sequences across tens to thousands of different samples.
Mewissen, Muriel +8 more
core +1 more source

