83 search results - page 14 / 17 » Variable size population for dynamic optimization with genet... |
CASES
2003
ACM
14 years 1 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...
4OR
2010
13 years 7 months ago
2010
This survey is concerned with the size of perfect formulations for combinatorial optimization problems. By "perfect formulation", we mean a system of linear inequalities...
ICRA
2002
IEEE
14 years 20 days ago
2002
IEEE
— In this paper, we present a method for co-evolving structures and controller of biped walking robots. Currently, biped walking humanoid robots are designed manually on trial-an...
PLDI
2010
ACM
14 years 24 days ago
2010
ACM
The availability of multicore processors has led to significant interest in compiler techniques for speculative parallelization of sequential programs. Isolation of speculative s...
CGO
2011
IEEE
12 years 11 months ago
2011
IEEE
—Approximating ideal program outputs is a common technique for solving computationally difficult problems, for adhering to processing or timing constraints, and for performance ...