Sciweavers

620 search results - page 60 / 124
» The computational power of population protocols
Sort
View
TEC
2008
135views more  TEC 2008»
14 years 9 months ago
Quantum Genetic Optimization
Abstract--The complexity of the selection procedure of a genetic algorithm that requires reordering, if we restrict the class of the possible fitness functions to varying fitness f...
Andrea Malossini, Enrico Blanzieri, T. Calarco
PERCOM
2005
ACM
15 years 9 months ago
When Does Opportunistic Routing Make Sense?
Different opportunistic routing protocols have been proposed recently for routing in sensor networks. These protocols exploit the redundancy among nodes by using a node that is av...
Adam Wolisz, Jan M. Rabaey, Rahul C. Shah, Sven Wi...
ICN
2005
Springer
15 years 3 months ago
Two Energy-Efficient Routing Algorithms for Wireless Sensor Networks
: Power Conservation is one of the most important challenges in wireless sensor networks. In this paper, we present two minimum-energy routing algorithms. Our main goal is to reduc...
Hung Le Xuan, Youngku Lee, Sungyoung Lee
GLOBECOM
2008
IEEE
15 years 4 months ago
A Low-Signalling Scheme for Distributed Resource Allocation in Multi-Cellular OFDMA Systems
—This paper considers distributed protocol design for joint sub-carrier, transmission scheduling and power management in uplink/downlink multi-cellular OFDMA wireless networks. T...
Pablo Soldati, Mikael Johansson
ESORICS
2010
Springer
14 years 11 months ago
Modeling and Analyzing Security in the Presence of Compromising Adversaries
Abstract. We present a framework for modeling adversaries in security protocol analysis, ranging from a Dolev-Yao style adversary to more powerful adversaries who can reveal differ...
David A. Basin, Cas J. F. Cremers