141 search results - page 4 / 29 » Heap Assumptions on Demand |
COCOON
2006
Springer
13 years 11 months ago
2006
Springer
We examine how to induce selfish heterogeneous users in a multicommodity network to reach an equilibrium that minimizes the social cost. In the absence of centralized coordination...
IWMM
2011
Springer
12 years 10 months ago
2011
Springer
To achieve optimal performance, garbage-collected applications must balance the sizes of their heaps dynamically. Sizing the heap too small can reduce throughput by increasing the...
MSOM
2008
13 years 6 months ago
2008
We analyze the problem of optimal location of a set of facilities in the presence of stochastic demand and congestion. Customers travel to the closest facility to obtain service; ...
IPL
2006
13 years 7 months ago
2006
We study an NP-hard (and MaxSNP-hard) problem in trees--Multicommodity Demand Flow--dealing with demand flows between pairs of nodes and trying to maximize the value of the routed...
SCAM
2005
IEEE
14 years 29 days ago
2005
IEEE
Long-running, heavily multi-threaded, Java server applications make stringent demands of garbage collector (GC) performance. Synchronisation of all application threads before garb...