Sciweavers

1469 search results - page 218 / 294
» A New Migration Model For Distributed Genetic Algorithms
Sort
View
APPROX
2009
Springer
142views Algorithms» more  APPROX 2009»
14 years 2 months ago
Optimal Sherali-Adams Gaps from Pairwise Independence
Abstract. This work considers the problem of approximating fixed predicate constraint satisfaction problems (MAX k-CSP(P)). We show that if the set of assignments accepted by P co...
Konstantinos Georgiou, Avner Magen, Madhur Tulsian...
ESCIENCE
2006
IEEE
14 years 2 months ago
Grid Approach to Embarrassingly Parallel CPU-Intensive Bioinformatics Problems
Bioinformatics algorithms such as sequence alignment methods based on profile-HMM (Hidden Markov Model) are popular but CPU-intensive. If large amounts of data are processed, a s...
Heinz Stockinger, Marco Pagni, Lorenzo Cerutti, La...
PPOPP
1999
ACM
14 years 16 days ago
Automatic Node Selection for High Performance Applications on Networks
A central problem in executing performance critical parallel and distributed applications on shared networks is the selection of computation nodes and communication paths for exec...
Jaspal Subhlok, Peter Lieu, Bruce Lowekamp
WWW
2010
ACM
14 years 3 months ago
Tracking the random surfer: empirically measured teleportation parameters in PageRank
PageRank computes the importance of each node in a directed graph under a random surfer model governed by a teleportation parameter. Commonly denoted alpha, this parameter models ...
David F. Gleich, Paul G. Constantine, Abraham D. F...
ICCAD
2003
IEEE
205views Hardware» more  ICCAD 2003»
14 years 1 months ago
Statistical Timing Analysis for Intra-Die Process Variations with Spatial Correlations
Process variations have become a critical issue in performance verification of high-performance designs. We present a new, statistical timing analysis method that accounts for int...
Aseem Agarwal, David Blaauw, Vladimir Zolotov