1594 search results - page 158 / 319 » An Algorithm to Compute Collusion Paths |
135
Voted
DIALM
2010
ACM
15 years 1 months ago
2010
ACM
We present a method for using real world mobility traces to identify tractable theoretical models for the study of distributed algorithms in mobile networks. We validate the metho...
111
Voted
ICDCS
2005
IEEE
15 years 9 months ago
2005
IEEE
DualPats exploits the strong correlation between TCP throughput and flow size, and the statistical stability of Internet path characteristics to accurately predict the TCP throug...
163
Voted
STACS
1994
Springer
15 years 7 months ago
1994
Springer
The complexity of the simple maxcut problem is investigated for several special classes of graphs. It is shown that this problem is NP-complete when restricted to one of the follo...
130
Voted
SAC
2008
ACM
15 years 2 months ago
2008
ACM
Test case prioritization for regression testing can be performed using different metrics (e.g., statement coverage, path coverage) depending on the application context. Employing ...
142
Voted
IPPS
1999
IEEE
15 years 7 months ago
1999
IEEE
HeteroSort load balances and sorts within static or dynamic networks. Upon failure of a node or path, HeteroSort uses a genetic algorithm to minimize the distribution path by optim...