Sciweavers

1184 search results - page 101 / 237
» Memory Design for Constrained Dynamic Optimization Problems
Sort
View
108
Voted
TJS
2008
95views more  TJS 2008»
15 years 2 months ago
Combating I-O bottleneck using prefetching: model, algorithms, and ramifications
Multiple memory models have been proposed to capture the effects of memory hierarchy culminating in the I-O model of Aggarwal and Vitter [?]. More than a decade of architectural a...
Akshat Verma, Sandeep Sen
ICCAD
2007
IEEE
123views Hardware» more  ICCAD 2007»
15 years 11 months ago
Mapping model with inter-array memory sharing for multidimensional signal processing
Abstract – The storage requirements in data-intensive signal processing systems (including applications in video and image processing, artificial vision, medical imaging, real-t...
Ilie I. Luican, Hongwei Zhu, Florin Balasa
HICSS
1995
IEEE
128views Biometrics» more  HICSS 1995»
15 years 6 months ago
Instruction Level Parallelism
Abstract. We reexamine the limits of parallelism available in programs, using runtime reconstruction of program data-flow graphs. While limits of parallelism have been examined in...
123
Voted
PODC
1999
ACM
15 years 7 months ago
Memory Space Requirements for Self-Stabilizing Leader Election Protocols
We study the memory requirements of self-stabilizing leader election (SSLE) protocols. We are mainly interested in two types of systems: anonymous systems and id-based systems. We...
Joffroy Beauquier, Maria Gradinariu, Colette Johne...
110
Voted
AAAI
2007
15 years 5 months ago
Anytime Optimal Coalition Structure Generation
A key problem when forming effective coalitions of autonomous agents is determining the best groupings, or the optimal coalition structure, to select to achieve some goal. To this...
Talal Rahwan, Sarvapali D. Ramchurn, Viet Dung Dan...