1594 search results - page 61 / 319 » An Algorithm to Compute Collusion Paths |
100
click to vote
AINA
2004
IEEE
15 years 3 months ago
2004
IEEE
Network services for finding a feasible or an optimal path subject to multiple constraints on performance metrics such as delay, jitter, loss probability, etc. give rise to multip...
103
click to vote
OPODIS
2010
14 years 9 months ago
2010
Abstract. Wireless Ad-hoc networks are distributed systems that often reside in error-prone environments. Self-stabilization lets the system recover autonomously from an arbitrary ...
106
click to vote
SPAA
2012
ACM
13 years 2 months ago
2012
ACM
We present a highly-scalable non-blocking producer-consumer task pool, designed with a special emphasis on lightweight synchronization and data locality. The core building block o...
107
click to vote
COMPGEOM
2008
ACM
15 years 1 months ago
2008
ACM
We consider the problem of finding a maximum number of disjoint paths for unit disks moving amidst static or dynamic obstacles. For the static case we give efficient exact algorit...
114
click to vote
ILP
2007
Springer
15 years 6 months ago
2007
Springer
Structural Statistical Software Testing (SSST) exploits the control flow graph of the program being tested to construct test cases. Specifically, SSST exploits the feasible paths...