Sciweavers

201 search results - page 5 / 41
» Predicting locality phases for dynamic memory optimization
Sort
View
ISCC
2005
IEEE
14 years 1 months ago
Optimal Delay-Constrained Minimum Cost Loop Algorithm for Local Computer Network
This study deals with the Delay-Constrained Minimum Cost Loop Problem (DC-MCLP) of finding several loops from a source node. The DC-MCLP consists of finding a set of minimum cost ...
Yong-Jin Lee, Mohammed Atiquzzaman
CDC
2010
IEEE
163views Control Systems» more  CDC 2010»
13 years 2 months ago
Integrated dynamic optimization and control in reservoir engineering using locally identified linear models
Abstract-- Studies on dynamic real-time optimization (DRTO) of waterflooding strategies in petroleum reservoirs have demonstrated that there exists a large potential to improve eco...
Gijs van Essen, Amin Rezapour, Paul M. J. Van den ...
CEC
2009
IEEE
14 years 2 months ago
Evolutionary programming with ensemble of explicit memories for dynamic optimization
—This paper presents the evolutionary programming with an ensemble of memories to deal with optimization problems in dynamic environments. The proposed algorithm modifies a recen...
Ling Yu, Ponnuthurai N. Suganthan
VLSID
2002
IEEE
96views VLSI» more  VLSID 2002»
14 years 9 days ago
Strategies for Improving Data Locality in Embedded Applications
This paper introduces a dynamic layout optimization strategy to minimize the number of cycles spent in memory accesses in a cache-based memory environment. In this approach, a giv...
N. E. Crosbie, Mahmut T. Kandemir, Ibrahim Kolcu, ...
CODES
2001
IEEE
13 years 11 months ago
Compiler-directed selection of dynamic memory layouts
Compiler technology is becoming a key component in the design of embedded systems, mostly due to increasing participation of software in the design process. Meeting system-level ob...
Mahmut T. Kandemir, Ismail Kadayif