1224 search results - page 27 / 245 » Design and Implementation of a Practical Parallel Delaunay A... |
CEC
2005
IEEE
15 years 7 months ago
2005
IEEE
Evolutionary Algorithms (EAs) are effective and robust methods for solving many practical problems such as feature selection, electrical circuits synthesis, and data mining. Howeve...
117
Voted
GECCO
2004
Springer
15 years 7 months ago
2004
Springer
Genetic algorithms require relatively large computation time to solve optimization problems, especially in VLSI CAD such as module placement. Therefore, island-based parallel GAs a...
113
Voted
EUROPAR
2004
Springer
15 years 7 months ago
2004
Springer
Computing a spanning tree and the connected components of a graph are basic problems in Graph Theory and arise as subproblems in many applications. Dehne et al. present a BSP/CGM a...
123
Voted
PARELEC
2006
IEEE
15 years 8 months ago
2006
IEEE
High performance computing in heterogeneous environments is a dynamically developing area. A number of highly efficient heterogeneous parallel algorithms have been designed over l...
140
click to vote
PPOPP
2012
ACM
13 years 9 months ago
2012
ACM
The linked-list data structure is fundamental and ubiquitous. Lockfree versions of the linked-list are well known. However, the existence of a practical wait-free linked-list has ...