2703 search results - page 273 / 541 » Optimizing memory transactions |
131
click to vote
ARC
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. Loops are an important source of optimization. In this paper, we address such optimizations for those cases when loops contain kernels mapped on reconfigurable fabric. We...
163
click to vote
CEC
2010
IEEE
15 years 5 months ago
2010
IEEE
In this paper, the dynamic multi-swarm particle swarm optimizer (DMS-PSO) and a sub-regional harmony search (SHS) are hybridized to obtain DMS-PSO-SHS. A Modified multi-trajectory ...
137
click to vote
CDC
2010
IEEE
14 years 11 months ago
2010
IEEE
The Markov chain approximation method is an effective and widely used approach for computing optimal values and controls for stochastic systems. It was extended to nonlinear (and p...
126
click to vote
DAC
2003
ACM
16 years 5 months ago
2003
ACM
The classic algorithm for optimal buffer insertion due to van Ginneken has time and space complexity O(n2 ), where n is the number of possible buffer positions. We present a new a...
129
click to vote
MICRO
2005
IEEE
15 years 9 months ago
2005
IEEE
The performance of a dynamic optimization system depends heavily on the code it selects to optimize. Many current systems follow the design of HP Dynamo and select a single interp...