5595 search results - page 754 / 1119 » Comparing Subsumption Optimizations |
222
click to vote
GECCO
2004
Springer
16 years 25 days ago
2004
Springer
Chemical Genetic Programming (CGP) is a new method of genetic programming that introduced collision-based biochemical processes and realized dynamic mapping from genotypic strings ...
200
Voted
ASPLOS
2010
ACM
16 years 23 days ago
2010
ACM
Symbiotic job scheduling boosts simultaneous multithreading (SMT) processor performance by co-scheduling jobs that have ‘compatible’ demands on the processor’s shared resour...
231
click to vote
CASES
2003
ACM
16 years 22 days 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...
224
Voted
WECWIS
2002
IEEE
16 years 11 days ago
2002
IEEE
Despite the large amounts of runtime needed to adequately solve a combinatorial auction (CA), existing iterative CA auction protocols require winner determination during every rou...
214
Voted
GECCO
2010
Springer
16 years 8 days ago
2010
Springer
The well-known Covariance Matrix Adaptation Evolution Strategy (CMA-ES) is a robust stochastic search algorithm for optimizing functions defined on a continuous search space RD ....