2808 search results - page 334 / 562 » Routing betweenness centrality |
132
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We propose a special computational device which uses light rays for solving the subset-sum problem. The device has a graph-like representation and the light is traversing it by fol...
178
click to vote
JDA
2008
15 years 6 months ago
2008
We show how to uniformly distribute data at random (not to be confounded with permutation routing) in two settings that are able to deal with massive data: coarse grained parallel...
241
click to vote
IPL
2006
15 years 6 months ago
2006
We study an NP-hard (and MaxSNP-hard) problem in trees--Multicommodity Demand Flow--dealing with demand flows between pairs of nodes and trying to maximize the value of the routed...
141
click to vote
JNW
2008
15 years 6 months ago
2008
The Gossip-based Sleep Protocol (GSP) is a routing protocol designed to save energy in Wireless Sensor Networks. This work presents two MAC protocols designed to complement the cha...
164
click to vote
JUCS
2008
15 years 6 months ago
2008
: This paper describes a new hybrid technique that combines a Greedy Randomized Adaptive Search Procedure (GRASP) and a genetic algorithm with simulation features in order to solve...