Sciweavers

TMC
2011
131views more  TMC 2011»
13 years 1 months ago
In-Network Computation in Random Wireless Networks: A PAC Approach to Constant Refresh Rates with Lower Energy Costs
—We propose a method to compute a probably approximately correct (PAC) normalized histogram of observations with a refresh rate of Âð1Þ time units per histogram sample on a ra...
Srikanth K. Iyer, D. Manjunath, R. Sundaresan
SSIRI
2010
13 years 5 months ago
Modelling and Implementing Complex Systems with Timebands
—We describe how to use a timeband architecture to model real-time requirements. The architecture separates requirements that use different time units, producing a family of mode...
Jim Woodcock, Marcel Oliveira, Alan Burns, Kun Wei
ESA
2001
Springer
75views Algorithms» more  ESA 2001»
13 years 11 months ago
Strongly Competitive Algorithms for Caching with Pipelined Prefetching
Suppose that a program makes a sequence of m accesses (references) to data blocks, the cache can hold k < m blocks, an access to a block in the cache incurs one time unit, and ...
Alexander Gaysinsky, Alon Itai, Hadas Shachnai
ISAAC
2004
Springer
102views Algorithms» more  ISAAC 2004»
14 years 8 days ago
On-Line Windows Scheduling of Temporary Items
In this paper we study on-line windows scheduling (WS) of temporary items. In a broadcasting system, there are some broadcast channels, each can broadcast one item in one time unit...
Wun-Tat Chan, Prudence W. H. Wong