133 search results - page 17 / 27 » Memory with memory: soft assignment in genetic programming |
AAAI
2008
13 years 9 months ago
2008
In distributed constraint optimization problems, dynamic programming methods have been recently proposed (e.g. DPOP). In dynamic programming many valuations are grouped together i...
PPOPP
2010
ACM
14 years 4 months ago
2010
ACM
Chip multi-processors (CMPs) have become ubiquitous, while tools that ease concurrent programming have not. The promise of increased performance for all applications through ever ...
CGO
2009
IEEE
14 years 2 months ago
2009
IEEE
—The StreamIt programming model has been proposed to exploit parallelism in streaming applications on general purpose multicore architectures. This model allows programmers to sp...
KES
1999
Springer
13 years 11 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...
CASES
2001
ACM
13 years 11 months ago
2001
ACM
In an embedded system, it is common to have several memory areas with different properties, such as access time and size. An access to a specific memory area is usually restricted...