Sciweavers

1434 search results - page 97 / 287
» Distributed Computing with Imperfect Randomness
Sort
View
JPDC
2008
129views more  JPDC 2008»
13 years 10 months ago
A framework for scalable greedy coloring on distributed-memory parallel computers
We present a scalable framework for parallelizing greedy graph coloring algorithms on distributed-memory computers. The framework unifies several existing algorithms and blends a ...
Doruk Bozdag, Assefaw Hadish Gebremedhin, Fredrik ...
ALIFE
1998
13 years 9 months ago
Computational Models for the Formation of Protocell Structures
There have been various attempts to simulate the self-assembly process of lipid aggregates by computers. However, due to the computationally complex nature of the problem, previou...
Linglan Edwards, Yun Peng, James A. Reggia
JCC
2008
166views more  JCC 2008»
13 years 10 months ago
Reference energy extremal optimization: A stochastic search algorithm applied to computational protein design
: We adapt a combinatorial optimization algorithm, extremal optimization (EO), for the search problem in computational protein design. This algorithm takes advantage of the knowled...
Naigong Zhang, Chen Zeng
CMOT
2002
112views more  CMOT 2002»
13 years 10 months ago
Finding Optimal Targets for Change Agents: A Computer Simulation of Innovation Diffusion
We introduce a diffusion of innovation model based on a network threshold approach. Realistic network and threshold data were gathered regarding the diffusion of new software tool...
Dirk Maienhofer, Thomas A. Finholt
NAA
2000
Springer
125views Mathematics» more  NAA 2000»
14 years 1 months ago
Matrix Computations Using Quasirandom Sequences
Abstract. The convergence of Monte Carlo method for numerical integration can often be improved by replacing pseudorandom numbers (PRNs) with more uniformly distributed numbers kno...
Michael Mascagni, Aneta Karaivanova