1594 search results - page 103 / 319 » An Algorithm to Compute Collusion Paths |
140
click to vote
JCM
2007
15 years 3 months ago
2007
—Today, most routing problems are solved using Dijkstra’s shortest path algorithm. Many efficient implementations of Dijkstra’s algorithm exist and can handle large networks ...
115
click to vote
INFOCOM
2007
IEEE
15 years 9 months ago
2007
IEEE
— This paper presents an algorithm for maximizing the lifetime of a sensor network while guaranteeing an upper bound on the end-to-end delay. We prove that the proposed algorithm...
132
click to vote
IPPS
2003
IEEE
15 years 8 months ago
2003
IEEE
We describe a peer-to-peer self-organizing overlay network for our global computing system. The preliminary simulation results show that the network has some smallworld characteri...
141
click to vote
WONS
2005
IEEE
15 years 8 months ago
2005
IEEE
In this paper we describe AntHocNet, an algorithm for routing in mobile ad hoc networks based on ideas from the Nature-inspired Ant Colony Optimization framework. The algorithm co...
124
click to vote
NETWORKS
2008
15 years 3 months ago
2008
Node pruning is a commonly used technique for solution acceleration in a dynamic programming network. In pruning, nodes are adaptively removed from the dynamic programming network...