Sciweavers

1259 search results - page 111 / 252
» On Survivable Access Network Design: Complexity and Algorith...
Sort
View
PODC
2009
ACM
16 years 6 months ago
Bounding the locality of distributed routing algorithms
d Abstract] Prosenjit Bose School of Computer Science Carleton University Ottawa, Canada jit@scs.carleton.ca Paz Carmi Dept. of Computer Science Ben-Gurion Univ. of the Negev Beer-...
Prosenjit Bose, Paz Carmi, Stephane Durocher
CIKM
2008
Springer
15 years 8 months ago
Classifying networked entities with modularity kernels
Statistical machine learning techniques for data classification usually assume that all entities are i.i.d. (independent and identically distributed). However, real-world entities...
Dell Zhang, Robert Mao
WIOPT
2010
IEEE
15 years 4 months ago
Cooperative diversity routing in wireless networks
—In this paper, we explore physical layer cooperative communication in order to design network layer routing algorithms that are energy efficient. We assume each node in the net...
Mostafa Dehghan, Majid Ghaderi, Dennis Goeckel
IWSOS
2011
Springer
14 years 9 months ago
Evolving Self-organizing Cellular Automata Based on Neural Network Genotypes
Abstract This paper depicts and evaluates an evolutionary design process for generating a complex self-organizing multicellular system based on Cellular Automata (CA). We extend th...
Wilfried Elmenreich, István Fehérv&a...
AINA
2007
IEEE
16 years 15 days ago
Heuristics for Improving Cryptographic Key Assignment in a Hierarchy
In hierarchical distributed systems, shared data access can be controlled by assigning user groups single cryptographic keys that allow high level users derive low level keys, but...
Anne V. D. M. Kayem, Patrick Martin, Selim G. Akl