1594 search results - page 100 / 319 » An Algorithm to Compute Collusion Paths |
145
click to vote
PODC
2003
ACM
15 years 8 months ago
2003
ACM
We investigate issues related to the probe complexity of quorum systems and their implementation in a dynamic environment. Our contribution is twofold. The first regards the algo...
151
click to vote
VRML
2004
ACM
15 years 8 months ago
2004
ACM
Increasingly, biology researchers and medical practitioners are using computational tools to model and analyze dynamic systems across scales from the macro to the cellular to the ...
120
click to vote
SOFSEM
2009
Springer
16 years 1 days ago
2009
Springer
During the last years, speed-up techniques for DIJKSTRA’s algorithm have been developed that make the computation of shortest paths a matter of microseconds even on huge road net...
126
click to vote
IPPS
2005
IEEE
15 years 8 months ago
2005
IEEE
: A fundamental problem in communication networks is wavelength assignment (WA): given a set of routing paths on a network, assign a wavelength to each path such that the paths wit...
125
click to vote
ANCS
2007
ACM
15 years 7 months ago
2007
ACM
To realize a path in an InfiniBand network, an address, known as Local IDentifier (LID) in the InfiniBand specification, must be assigned to the destination and used in the forwar...