15494 search results - page 2973 / 3099 » Computing dynamic clusters |
ICS
2001
Tsinghua U.
14 years 2 months ago
2001
Tsinghua U.
This paper presents a novel technique to perform global optimization of communication and preprocessing calls in the presence of array accesses with arbitrary subscripts. Our sche...
OHS
2001
Springer
14 years 2 months ago
2001
Springer
Adaptation/personalization is one of the main issues for web applications and require large repositories. Creating adaptive web applications from these repositories requires to hav...
SPIN
2001
Springer
14 years 2 months ago
2001
Springer
ions Using SPIN . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16 Marsha Chechik, Benet Devereux, Arie Gurfinkel (University of Toronto) Imp...
FOCS
2000
IEEE
14 years 2 months ago
2000
IEEE
We present dynamic search-tree data structures that perform well in the setting of a hierarchical memory (including various levels of cache, disk, etc.), but do not depend on the ...
ICNP
2000
IEEE
14 years 2 months ago
2000
IEEE
In order to detect violations of end-to-end service level agreements (SLA) and to isolate trouble links and nodes based on a unified framework, managers of a service provider net...