1594 search results - page 162 / 319 » An Algorithm to Compute Collusion Paths |
128
Voted
SIGCOMM
2005
ACM
15 years 9 months ago
2005
ACM
Predicting the throughput of large TCP transfers is important for a broad class of applications. This paper focuses on the design, empirical evaluation, and analysis of TCP throug...
114
Voted
SMA
1999
ACM
15 years 7 months ago
1999
ACM
Accurate prediction of the swept volume of a cutting tool is essential in NC verification algorithms for detecting deficiencies in a proposed tool path, such as gouging, undercutt...
146
Voted
COMPGEOM
2005
ACM
15 years 5 months ago
2005
ACM
We introduce a new type of diagram called the VV(c)-diagram (the visibility–Voronoi diagram for clearance c), which is a hybrid between the visibility graph and the Voronoi diag...
117
Voted
AIPS
2009
15 years 4 months ago
2009
Current state-of-the-art planners solve problems, easy and hard alike, by search, expanding hundreds or thousands of nodes. Yet, given the ability of people to solve easy problems...
124
Voted
CCR
2000
15 years 3 months ago
2000
Distributed optimal traffic engineering in the presence of multiple paths has been found to be a difficult problem to solve. In this paper, we introduce a new approach in an attem...