6105 search results - page 334 / 1221 » A Parallel Algorithm for Bound-Smoothing |
156
click to vote
IPPS
2007
IEEE
16 years 1 months ago
2007
IEEE
Multi-core processors are a shift of paradigm in computer architecture that promises a dramatic increase in performance. But multi-core processors also bring an unprecedented leve...
170
click to vote
ICPP
2003
IEEE
16 years 18 hour ago
2003
IEEE
Define anycast services as a group of replicated servers that may provide similar or identical services. Using anycast services can significantly simplify some applications such...
152
click to vote
GECCO
2005
Springer
16 years 8 days ago
2005
Springer
Genetic Algorithms have worked fairly well for the VLSI cell placement problem, albeit with significant run times. Two parallel models for GA are presented for VLSI cell placemen...
158
click to vote
ASPDAC
2008
ACM
15 years 8 months ago
2008
ACM
Content addressable memory (CAM) is frequently used in applications, such as lookup tables, databases, associative computing, and networking, that require high-speed searches due t...
183
Voted
JPDC
2007
15 years 6 months ago
2007
Object space (OS) parallelization of an efficient direct volume rendering algorithm for unstructured grids on distributed-memory architectures is investigated. The adaptive OS de...