1594 search results - page 104 / 319 » An Algorithm to Compute Collusion Paths |
119
click to vote
INFOCOM
2003
IEEE
15 years 8 months ago
2003
IEEE
— We investigate the problem of computing the types of the relationships between Internet Autonomous Systems. We refer to the model introduced in [1], [2] that bases the discover...
163
click to vote
NETWORKING
2000
15 years 4 months ago
2000
We present an approximate analytical method to compute efficiently the call blocking probabilities in wavelength routing networks with multiple classes of calls. The model is fairl...
158
click to vote
MOBIHOC
2004
ACM
15 years 8 months ago
2004
ACM
In third generation (3G) wireless data networks, repeated requests for popular data items can exacerbate the already scarce wireless spectrum. In this paper we propose an architec...
150
click to vote
DALT
2008
Springer
15 years 5 months ago
2008
Springer
ing and Verifying Strategy-proofness for Auction Mechanisms E. M. Tadjouddine, F. Guerin, and W. Vasconcelos Department of Computing Science, King's College, University of Abe...
132
click to vote
CCS
2011
ACM
14 years 3 months ago
2011
ACM
Online service providers are engaged in constant conflict with miscreants who try to siphon a portion of legitimate traffic to make illicit profits. We study the abuse of “tr...