141 search results - page 5 / 29 » Heap Assumptions on Demand |
JSAC
2007
13 years 7 months ago
2007
—This paper derives the optimal search time and the optimal search cost that can be achieved in unstructured peer-topeer networks when the demand pattern exhibits clustering (i.e...
ICPP
2002
IEEE
14 years 10 days ago
2002
IEEE
A cost-effective approach to building up scalable Videoon-Demand (VoD) servers is to couple a number of VoD servers together in a cluster. In this article, we study a crucial vide...
IWMM
2010
Springer
13 years 9 months ago
2010
Springer
The accurate prediction of program's memory requirements is a critical component in software development. Existing heap space analyses either do not take deallocation into ac...
INFOCOM
2006
IEEE
14 years 1 months ago
2006
IEEE
— More and more traffic management techniques, including accounting and load adaptive routing, try to take advantage of the fact that traffic demands are consistent with Zipf...
MOBIHOC
2007
ACM
14 years 7 months ago
2007
ACM
Existing work on the capacity of wireless networks predominantly considers homogeneous random networks with random work load. The most relevant bounds on the network capacity, e.g...