1184 search results - page 53 / 237 » Memory Design for Constrained Dynamic Optimization Problems |
DAC
2004
ACM
16 years 2 months ago
2004
ACM
Scratch-pad memories (SPMs) enable fast access to time-critical data. While prior research studied both static and dynamic SPM management strategies, not being able to keep all ho...
115
click to vote
AUTOMATICA
2005
15 years 1 months ago
2005
This paper presents a new approach to shaping of the frequency response of the sensitivity function. In this approach, a desired frequency response is assumed to be specified at a...
146
click to vote
PAMI
2012
13 years 4 months ago
2012
—The problem of automatic and optimal design of embedded object detector cascades is considered. Two main challenges are identified: optimization of the cascade configuration and...
119
click to vote
EUROCAST
2009
Springer
15 years 8 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
113
click to vote
IEEEPACT
2000
IEEE
15 years 6 months ago
2000
IEEE
Region-based compilation repartitions a program into more desirable compilation units for optimization and scheduling, particularly beneficial for ILP architectures. With region-...