1057 search results - page 70 / 212 » Peer-to-Peer utility maximization |
MEMOCODE
2003
IEEE
15 years 3 months ago
2003
IEEE
In this paper, we present a technique for determining tight bounds on the execution time of assembler programs. Thus, our method is independent of the design flow, but takes into...
106
click to vote
ICMCS
1995
IEEE
15 years 1 months ago
1995
IEEE
The immensity of the datatransfer requirements of multimediaobjects will require multimediaservers tobe foundedon disk arrays. To effectively utilize a disk array, and hence to ma...
NIPS
2003
14 years 11 months ago
2003
We present a novel strategy for automatically debugging programs given sampled data from thousands of actual user runs. Our goal is to pinpoint those features that are most correl...
INFOCOM
2008
IEEE
15 years 4 months ago
2008
IEEE
— In this paper we study the problem of jointly performing scheduling and congestion control in mobile adhoc networks so that network queues remain bounded and the resulting flo...
SIAMCO
2011
14 years 4 months ago
2011
The choice of admissible trading strategies in mathematical modelling of financial markets is a delicate issue, going back to Harrison and Kreps [HK79]. In the context of optimal...