Sciweavers

4962 search results - page 85 / 993
» Connectivity in Sub-Poisson Networks
Sort
View
COMSWARE
2008
IEEE
16 years 16 days ago
Deterministic schemes for key distribution in wireless sensor networks
— In this paper, we propose a new security metric for measuring resilience of a symmetric key distribution scheme in wireless sensor network. A polynomial-based and a novel compl...
Abhishek Gupta, Joy Kuri
TPDS
2010
109views more  TPDS 2010»
15 years 4 months ago
Minimal Sets of Turns for Breaking Cycles in Graphs Modeling Networks
Abstract—We propose an algorithm that provides for deadlockfree and livelock-free routing, in particular in wormhole routed networks. The proposed algorithm requires nearly minim...
Lev B. Levitin, Mark G. Karpovsky, Mehmet Mustafa
COCOON
2007
Springer
16 years 7 days ago
Connected Coloring Completion for General Graphs: Algorithms and Complexity
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
Benny Chor, Michael R. Fellows, Mark A. Ragan, Igo...
LADC
2007
Springer
16 years 6 days ago
Connectivity in Eventually Quiescent Dynamic Distributed Systems
A distributed dynamic system is a fully distributed system subject to a continual arrival/departure of the entities defining the system. Another characterizing dimension of these ...
Sara Tucci Piergiovanni, Roberto Baldoni
ICANN
2007
Springer
16 years 7 days ago
Evolutionary Multi-objective Optimization of Spiking Neural Networks
Evolutionary multi-objective optimization of spiking neural networks for solving classification problems is studied in this paper. By means of a Paretobased multi-objective geneti...
Yaochu Jin, Ruojing Wen, Bernhard Sendhoff