922 search results - page 44 / 185 » Fairness, Resources, and Separation |
ESOP
2004
Springer
15 years 3 months ago
2004
Springer
t) Peter W. O’Hearn Queen Mary, University of London In the 1960s Dijkstra suggested that, in order to limit the complexity of potential process interactions, concurrent programs...
171
click to vote
POPL
2005
ACM
15 years 10 months ago
2005
ACM
A lightweight logical approach to race-free sharing of heap storage between concurrent threads is described, based on the notion of permission to access. Transfer of permission be...
FOCS
1990
IEEE
15 years 2 months ago
1990
IEEE
Two of the most commonly used models in computational learning theory are the distribution-free model in which examples are chosen from a fixed but arbitrary distribution, and the ...
100
click to vote
VTC
2010
IEEE
14 years 8 months ago
2010
IEEE
—In this paper, we propose a new resource allocation scheme for an OFDMA relay network with multicells. In the proposed scheme, by sharing the channel state information (CSI) bet...
INFOCOM
2007
IEEE
15 years 4 months ago
2007
IEEE
—This paper presents a theoretic framework of optimal resource allocation and admission control for peer-topeer networks. Peer’s behavioral rankings are incorporated into the r...