1594 search results - page 180 / 319 » An Algorithm to Compute Collusion Paths |
127
click to vote
RTCSA
2007
IEEE
15 years 9 months ago
2007
IEEE
An important property in a sensor network is the monitoring of temporal changes of hazardous situations such as forest fires. Rescue groups need to be aware of dynamic changes th...
185
Voted
PODC
2012
ACM
13 years 6 months ago
2012
ACM
The goal of Byzantine Broadcast (BB) is to allow a set of fault-free nodes to agree on information that a source node wants to broadcast to them, in the presence of Byzantine faul...
129
click to vote
STACS
2010
Springer
15 years 10 months ago
2010
Springer
We revisit several maximization problems for geometric networks design under the non-crossing constraint, first studied by Alon, Rajagopalan and Suri (ACM Symposium on Computation...
121
Voted
SIGECOM
2006
ACM
15 years 9 months ago
2006
ACM
Graphical games have been proposed as a game-theoretic model of large-scale distributed networks of non-cooperative agents. When the number of players is large, and the underlying...
115
Voted
JUCS
2010
15 years 1 months ago
2010
Abstract: This paper discusses three rectilinear (that is, axis-parallel) covering problems in d dimensions and their variants. The first problem is the Rectilinear Line Cover whe...