1594 search results - page 264 / 319 » An Algorithm to Compute Collusion Paths |
129
click to vote
ICFEM
2009
Springer
15 years 20 days ago
2009
Springer
In this paper we continue the study of a strict extension of the Computation Tree Logic, called graded-CTL, recently introduced by the same authors. This new logic augments the sta...
124
click to vote
SIGECOM
2006
ACM
15 years 9 months ago
2006
ACM
We consider a multicast game with selfish non-cooperative players. There is a special source node and each player is interested in connecting to the source by making a routing de...
104
Voted
PADS
2005
ACM
15 years 8 months ago
2005
ACM
A fundamental requirement for any network simulation environment is the realistic forwarding of packets from a source to a destination in the simulated topology. The routing decis...
128
click to vote
SPAA
2005
ACM
15 years 8 months ago
2005
ACM
An important problem for wireless ad hoc networks has been to design overlay networks that allow time- and energy-efficient routing. Many local-control strategies for maintaining...
163
click to vote
WMASH
2003
ACM
15 years 8 months ago
2003
ACM
In the near future, wide variety of wireless networks will be merged into the Internet and allow users to continue their application with higher degree of mobility. In such enviro...