Sciweavers

556 search results - page 26 / 112
» Fast parallel GPU-sorting using a hybrid algorithm
Sort
View
JPDC
2006
134views more  JPDC 2006»
13 years 8 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong
SYNASC
2005
IEEE
110views Algorithms» more  SYNASC 2005»
14 years 2 months ago
Performance Tuning of Evolutionary Algorithms Using Particle Sub Swarms
Particle Swarm Optimization (PSO) technique proved its ability to deal with very complicated optimization and search problems. This paper proposes a new particle swarm variant whi...
Crina Grosan, Ajith Abraham, Monica Nicoara
ISBRA
2009
Springer
14 years 3 months ago
A Linear-Time Algorithm for Analyzing Array CGH Data Using Log Ratio Triangulation
Abstract. DNA copy number is the number of replicates of a contiguous segment of DNA on the genome. Copy number alteration (CNA) is a genetic abnormality in which the number of the...
Matthew Hayes, Jing Li
HPDC
2010
IEEE
13 years 9 months ago
A hybrid Markov chain model for workload on parallel computers
This paper proposes a comprehensive modeling architecture for workloads on parallel computers using Markov chains in combination with state dependent empirical distribution functi...
Anne Krampe, Joachim Lepping, Wiebke Sieben
IPPS
1998
IEEE
14 years 26 days ago
Meta-heuristics for Circuit Partitioning in Parallel Test Generation
In this communication Simulated Annealing and Genetic Algorithms, are applied to the graph partitioning problem. These techniques mimic processes in statistical mechanics and biol...
Consolación Gil, Julio Ortega, Antonio F. D...