141 search results - page 8 / 29 » Heap Assumptions on Demand |
JTRES
2010
ACM
13 years 7 months ago
2010
ACM
In order to guarantee that real-time systems meet their timing specification, static execution time bounds need to be calculated. Not considering execution time predictability led...
SODA
2008
ACM
13 years 8 months ago
2008
ACM
In this paper, we study online algorithms when the input is not chosen adversarially, but consists of draws from some given probability distribution. While this model has been stu...
COR
2007
13 years 7 months ago
2007
The p-center problem is to locate p facilities in a network of n demand points so as to minimize the longest distance between a demand point and its nearest facility. We consider ...
IEEEARES
2008
IEEE
14 years 1 months ago
2008
IEEE
With the growing demand of databases outsourcing and its security concerns, we investigate privacy-preserving set intersection in a distributed scenario. We propose a one-round pr...
IOR
2010
13 years 5 months ago
2010
There is a general agreement since Allaz-Vila’s seminal contribution that forward contracts mitigate market power on the spot market. This result is widely quoted and elaborated...