169 search results - page 1 / 34 » Layered Working-Set Trees |
LATIN
2010
Springer
13 years 11 months ago
2010
Springer
The working-set bound [Sleator and Tarjan, J. ACM, 1985] roughly states that searching for an element is fast if the element was accessed recently. Binary search trees, such as sp...
PE
2010
Springer
12 years 11 months ago
2010
Springer
Accurately characterizing the resource usage of an application at various levels in the memory hierarchy has been a long-standing research problem. Existing characterization studi...
11
Voted
ICPR
2008
IEEE
13 years 11 months ago
2008
IEEE
We present an online adaptive clustering algorithm in a decision tree framework which has an adaptive tree and a code formation layer. The code formation layer stores the represen...
ADHOC
2010
12 years 11 months ago
2010
In this paper, we investigate the low coverage problem of efficient broadcast protocols in wireless ad hoc networks with realistic physical layer models. To minimize energy consum...
WOSP
2004
ACM
13 years 10 months ago
2004
ACM
This paper analyzes the performability of client-server applications that use a separate fault management architecture for monitoring and controlling of the status of the applicat...