134 search results - page 8 / 27 » A Memetic Algorithm for the Generalized Minimum Vertex-Bicon... |
TIT
2008
13 years 7 months ago
2008
The problem of computing functions of values at the nodes in a network in a fully distributed manner, where nodes do not have unique identities and make decisions based only on loc...
MOBIHOC
2012
ACM
11 years 10 months ago
2012
ACM
We propose a routing scheme to implement multicast communication in wireless networks. The scheme is oblivious, compact, and completely decentralized. It is intended to support dy...
GLOBECOM
2006
IEEE
14 years 1 months ago
2006
IEEE
— This paper considers the problem of finding the path with minimum (zero) worst possible number of errors in a network with V nodes where (1) some nodes are capable of correcti...
WADS
1995
Springer
13 years 11 months ago
1995
Springer
We examine the problem of transmitting in minimum time a given amount of data between a source and a destination in a network with finite channel capacities and non–zero propaga...
NETWORKS
2010
13 years 5 months ago
2010
Let G = (V, E, Q) be a undirected graph, where V is the set of vertices, E is the set of edges, and Q = {Q1, . . . , Qq} is a partition of V into q subsets. We refer to Q1, . . . ...