1074 search results - page 135 / 215 » Parallelizing post-placement timing optimization |
BIBE
2008
IEEE
14 years 3 months ago
2008
IEEE
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...
ICS
2005
Tsinghua U.
14 years 2 months ago
2005
Tsinghua U.
A key step in program optimization is the determination of optimal values for code optimization parameters such as cache tile sizes and loop unrolling factors. One approach, which...
ICS
2007
Tsinghua U.
14 years 3 months ago
2007
Tsinghua U.
Software or hardware data cache prefetching is an efficient way to hide cache miss latency. However effectiveness of the issued prefetches have to be monitored in order to maximi...
CLUSTER
2003
IEEE
14 years 2 months ago
2003
IEEE
We further increase the efficiency of Java RMI programs. Where other optimizing re-implementations of RMI use pre-processors to create stubs and skeletons and to create class spe...
ACRI
2004
Springer
14 years 2 months ago
2004
Springer
We have investigated a problem where the goal is to find automatically the best rule for a cell in the cellular automata model. The cells are either of type OBSTACLE, EMPTY or CRE...