284 search results - page 35 / 57 » Linear Time Algorithms for Generalized Edge Dominating Set P... |
WINE
2005
Springer
14 years 1 months ago
2005
Springer
Consider a network vulnerable to viral infection. The system security software can guarantee safety only to a limited part of the network. Such limitations result from economy cos...
ATAL
2010
Springer
13 years 8 months ago
2010
Springer
In large wireless sensor networks, the problem of assigning radio frequencies to sensing agents such that no two connected sensors are assigned the same value (and will thus inter...
GECCO
2009
Springer
14 years 2 months ago
2009
Springer
This work provides an analysis of using the evolutionary algorithm EPNet to create ensembles of artificial neural networks to solve a range of forecasting tasks. Several previous...
ICDCS
2006
IEEE
14 years 1 months ago
2006
IEEE
In this paper, we study distributed approximation algorithms for fault-tolerant clustering in wireless ad hoc and sensor networks. A k-fold dominating set of a graph G = (V, E) is...
JGAA
2000
13 years 7 months ago
2000
Current orthogonal graph drawing algorithms produce drawings which are generally good. However, many times the quality of orthogonal drawings can be significantly improved with a ...