12950 search results - page 573 / 2590 » On Optimal Timed Strategies |
180
click to vote
SWAT
2004
Springer
16 years 20 days ago
2004
Springer
The first polynomial time algorithm (O(n4 )) for modular decomposition appeared in 1972 [8] and since then there have been incremental improvements, eventually resulting in linear...
159
click to vote
GECCO
2003
Springer
16 years 16 days ago
2003
Springer
Abstract. This paper develops a model for tightness time, linkage learning time for a single building block, in the linkage learning genetic algorithm (LLGA). First, the existing m...
180
click to vote
SBACPAD
2004
IEEE
15 years 8 months ago
2004
IEEE
The aim of the paper is to introduce techniques in order to optimize the parallel execution time of sorting on heterogeneous platforms (processors speeds are related by a constant...
271
click to vote
ICDE
2007
IEEE
16 years 8 months ago
2007
IEEE
Traditional DBMSs decouple statistics collection and query optimization both in space and time. Decoupling in time may lead to outdated statistics. Decoupling in space may cause s...
183
click to vote
DAC
2006
ACM
16 years 8 months ago
2006
ACM
Chips manufactured in 90 nm technology have shown large parametric variations, and a worsening trend is predicted. These parametric variations make circuit optimization difficult ...