2609 search results - page 191 / 522 » Optimizing for parallelism and data locality |
170
click to vote
SAMOS
2005
Springer
16 years 21 hour ago
2005
Springer
This paper presents a new tool for the automatic generation of highly parallelized Finite Impulse Response (FIR) filters. In this approach we follow our PARO design methodology. P...
180
click to vote
PPSN
2000
Springer
15 years 10 months ago
2000
Springer
In this paper, we propose a competitive image segmentation algorithm. It is a dynamic evolving optimization method, which we call the population algorithm. The method is inspired f...
177
click to vote
CEC
2009
IEEE
16 years 1 months ago
2009
IEEE
— We extend the Evolution Strategy with Covariance Matrix Adaptation (CMA-ES) by collaborative concepts from Particle Swarm Optimization (PSO). The proposed Particle Swarm CMA-ES...
194
click to vote
DC
2010
15 years 6 months ago
2010
We present a novel distributed algorithm for the maximal independent set (MIS) problem.1 On bounded-independence graphs (BIG) our deterministic algorithm finishes in O(log n) time,...
161
click to vote
CAGD
2002
15 years 6 months ago
2002
Many applications, such as contour machining, rapid prototyping, and reverse engineering by laser scanner or coordinate measuring machine, involve sampling of free-from surfaces a...