213 search results - page 43 / 43 » A comparison of search heuristics for empirical code optimiz... |
ICCAD
2008
IEEE
15 years 6 months ago
2008
IEEE
— In today’s VLSI designs, there can be many blockages in a routing region. The obstacle-avoiding rectilinear Steiner minimum tree (OARSMT) problem has become an important prob...
102
click to vote
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Multiprocessor task scheduling is an important and computationally difficult problem. This paper proposes a comparison study of genetic algorithm and list scheduling algorithm. Bo...
VLDB
2001
ACM
15 years 2 months ago
2001
ACM
Bulk loading refers to the process of creating an index from scratch for a given data set. This problem is well understood for B-trees, but so far, non-traditional index structure...