1078 search results - page 19 / 216 » Networks with Small Stretch Number |
ICPP
1998
IEEE
14 years 2 months ago
1998
IEEE
The crew planning problem has been successfully solved on a loosely connected network of workstations (NOW) using advanced computational techniques and efficient communication pat...
ICNP
2009
IEEE
14 years 4 months ago
2009
IEEE
—In this paper, we describe oCast, an energy-optimal multicast routing protocol for wireless sensor networks. The general minimum-energy multicast problem is NP-hard. Intermitten...
JCO
2010
13 years 8 months ago
2010
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
ICASSP
2009
IEEE
13 years 7 months ago
2009
IEEE
We consider the optimization of multicast over packet-switched communication networks with a non-zero packet-loss probability. For the system setup consisting of a number of multi...
EPIA
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. In social network analysis, a k-clique is a relaxed clique, i.e., a kclique is a quasi-complete sub-graph. A k-clique in a graph is a sub-graph where the distance between...