Sciweavers

14382 search results - page 2807 / 2877
» Time in Connectionist Models
Sort
View
DCOSS
2006
Springer
14 years 28 days ago
Lifetime Maximization of Sensor Networks Under Connectivity and k-Coverage Constraints
In this paper, we study the fundamental limits of a wireless sensor network's lifetime under connectivity and k-coverage constraints. We consider a wireless sensor network wit...
Wei Mo, Daji Qiao, Zhengdao Wang
CASES
2001
ACM
14 years 27 days ago
A system-on-a-chip lock cache with task preemption support
Intertask/interprocess synchronization overheads may be significant in a multiprocessor-shared memory System-on-a-Chip implementation. These overheads are observed in terms of loc...
Bilge Saglam Akgul, Jaehwan Lee, Vincent John Moon...
CHARME
2003
Springer
110views Hardware» more  CHARME 2003»
14 years 27 days ago
Exact and Efficient Verification of Parameterized Cache Coherence Protocols
Abstract. We propose new, tractably (in some cases provably) efficient algorithmic methods for exact (sound and complete) parameterized reasoning about cache coherence protocols. F...
E. Allen Emerson, Vineet Kahlon
ESA
1998
Springer
162views Algorithms» more  ESA 1998»
14 years 26 days ago
External Memory Algorithms
Abstract. Data sets in large applications are often too massive to t completely inside the computer's internal memory. The resulting input output communication or I O between ...
Jeffrey Scott Vitter
ISCA
2000
IEEE
93views Hardware» more  ISCA 2000»
14 years 25 days ago
Reconfigurable caches and their application to media processing
High performance general-purpose processors are increasingly being used for a variety of application domains scienti c, engineering, databases, and more recently, media processing...
Parthasarathy Ranganathan, Sarita V. Adve, Norman ...
« Prev « First page 2807 / 2877 Last » Next »