210 search results - page 14 / 42 » Excludability and Bounded Computational Capacity |
113
Voted
P2P
2007
IEEE
15 years 10 months ago
2007
IEEE
Current P2P systems employ tit-for-tat strategies, where peers only upload when they are simultaneously downloading, to avoid free riding. We derive optimal tit-for-tat strategies...
131
Voted
CHARME
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We define and study a quantitative generalization of the traditional boolean framework of model-based specification and verification. In our setting, propositions have...
126
Voted
PSD
2010
Springer
15 years 2 months ago
2010
Springer
Minimum-distance controlled tabular adjustment methods (CTA), and its restricted variants (RCTA), is a recent perturbative approach for tabular data protection. Given a table to be...
122
click to vote
PODC
2005
ACM
15 years 9 months ago
2005
ACM
In this paper we consider the weighted, capacitated vertex cover problem with hard capacities (capVC). Here, we are given an undirected graph G = (V, E), non-negative vertex weigh...
150
Voted
SPAA
2004
ACM
15 years 9 months ago
2004
ACM
In this paper, we examine the problem of large-volume data dissemination via overlay networks. A natural way to maximize the throughput of an overlay multicast session is to split...