203 search results - page 4 / 41 » A parallel evolutionary algorithm to optimize dynamic memory... |
144
Voted
KES
1999
Springer
15 years 7 months ago
1999
Springer
Abstract—Dynamic Demes is a new method for the parallelisation of evolutionary algorithms. It was derived as a combination of two other parallelisation algorithms: the master-sla...
137
Voted
EMSOFT
2010
Springer
15 years 22 days ago
2010
Springer
We propose the first polynomial-time code selection algorithm for minimising the worst-case execution time of a nonnested loop executed on a fully pipelined processor that uses sc...
143
Voted
ASPDAC
2001
ACM
15 years 6 months ago
2001
ACM
Power-efficient design requires reducing power dissipation in all parts of the design and during all stages of the design process subject to constraints on the system performance ...
103
click to vote
GECCO
2010
Springer
15 years 2 months ago
2010
Springer
In this paper we present a concurrent implementation of genetic algorithms designed for shared memory architectures intended to take advantage of multi-core processor platforms. O...
141
Voted
CASES
2003
ACM
15 years 8 months ago
2003
ACM
This paper presents a highly predictable, low overhead and yet dynamic, memory allocation strategy for embedded systems with scratch-pad memory. A scratch-pad is a fast compiler-m...