1184 search results - page 76 / 237 » Memory Design for Constrained Dynamic Optimization Problems |
GECCO
2009
Springer
15 years 9 months ago
2009
Springer
Recently, it has been proven that evolutionary algorithms produce good results for a wide range of combinatorial optimization problems. Some of the considered problems are tackled...
105
click to vote
IROS
2009
IEEE
15 years 9 months ago
2009
IEEE
— Parametric excitation walking is one of methods that realize a passive dynamic like walking on the level ground. In parametric excitation walking, up-and-down motion of the cen...
112
click to vote
DEBU
2000
15 years 2 months ago
2000
Execution plans produced by traditional query optimizers for data integration queries may yield poor performance for several reasons. The cost estimates may be inaccurate, the mem...
107
click to vote
USENIX
1994
15 years 3 months ago
1994
This paper presents a comprehensive design overview of the SunOS 5.4 kernel memory allocator. This allocator is based on a set of object-caching primitives that reduce the cost of...
97
Voted
DAC
2007
ACM
16 years 3 months ago
2007
ACM
Process variation has become a critical problem in modern VLSI fabrication. In the presence of process variation, buffer insertion problem under performance constraints becomes mo...