Sciweavers

141 search results - page 28 / 29
» Heap Assumptions on Demand
Sort
View
ALGORITHMICA
2000
161views more  ALGORITHMICA 2000»
13 years 7 months ago
Binary Searching with Nonuniform Costs and Its Application to Text Retrieval
We study the problem of minimizing the expected cost of binary searching for data where the access cost is not fixed and depends on the last accessed element, such as data stored i...
Gonzalo Navarro, Ricardo A. Baeza-Yates, Eduardo F...
TRANSCI
1998
78views more  TRANSCI 1998»
13 years 7 months ago
Queue Spillovers in Transportation Networks with a Route Choice
This paper explores some of the traffic phenomena that arise when drivers have to navigate a network in which queues back up past diverge intersections. If a diverge provides two ...
Carlos F. Daganzo
INFOCOM
2010
IEEE
13 years 5 months ago
Distributed Caching Algorithms for Content Distribution Networks
—The delivery of video content is expected to gain huge momentum, fueled by the popularity of user-generated clips, growth of VoD libraries, and wide-spread deployment of IPTV se...
Sem C. Borst, Varun Gupta, Anwar Walid
SIGMOD
2011
ACM
158views Database» more  SIGMOD 2011»
12 years 10 months ago
Workload-aware database monitoring and consolidation
In most enterprises, databases are deployed on dedicated database servers. Often, these servers are underutilized much of the time. For example, in traces from almost 200 producti...
Carlo Curino, Evan P. C. Jones, Samuel Madden, Har...
ATAL
2011
Springer
12 years 7 months ago
Maximizing revenue in symmetric resource allocation systems when user utilities exhibit diminishing returns
Consumers of resources in realistic applications (e.g., web, multimedia) typically derive diminishing-return utilities from the amount of resource they receive. A resource provide...
Roie Zivan, Miroslav Dudík, Praveen Paruchu...