Sciweavers

3584 search results - page 128 / 717
» Parallel Computing of Thermoelasticity Problems
Sort
View
127
Voted
PPSN
2010
Springer
15 years 1 months ago
Fixed Parameter Evolutionary Algorithms and Maximum Leaf Spanning Trees: A Matter of Mutation
Abstract. Evolutionary algorithms have been shown to be very successful for a wide range of NP-hard combinatorial optimization problems. We investigate the NP-hard problem of compu...
Stefan Kratsch, Per Kristian Lehre, Frank Neumann,...
170
Voted
SPDP
1996
IEEE
15 years 6 months ago
Impact Of Load Balancing On Unstructured Adaptive Grid Computations For Distributed-Memory Multiprocessors
The computational requirements for an adaptive solution of unsteady problems change as the simulation progresses. This causes workload imbalance among processors on a parallel mac...
Andrew Sohn, Rupak Biswas, Horst D. Simon
106
Voted
BMVC
2000
15 years 4 months ago
Parallel Chains, Delayed Rejection and Reversible Jump MCMC for Object Recognition
We tackle the problem of object recognition using a Bayesian approach. A marked point process [1] is used as a prior model for the (unknown number of) objects. A sample is generat...
M. Harkness, P. Green
117
Voted
ISPAN
1997
IEEE
15 years 6 months ago
RMESH Algorithms for Parallel String Matching
Abstract- String matching problem received much attention over the years due to its importance in various applications such as text/file comparison, DNA sequencing, search engines,...
Hsi-Chieh Lee, Fikret Erçal
LCPC
1998
Springer
15 years 6 months ago
HPF-2 Support for Dynamic Sparse Computations
There is a class of sparse matrix computations, such as direct solvers of systems of linear equations, that change the fill-in (nonzero entries) of the coefficient matrix, and invo...
Rafael Asenjo, Oscar G. Plata, Juan Touriño...