Sciweavers

1718 search results - page 190 / 344
» Communicating more than nothing
Sort
View
173
Voted
LICS
2000
IEEE
15 years 10 months ago
Virtual Symmetry Reduction
We provide a general method for ameliorating state explosion via symmetry reduction in certain asymmetric systems, such as systems with many similar, but not identical, processes....
E. Allen Emerson, John Havlicek, Richard J. Trefle...
189
Voted
ACSAC
2007
IEEE
15 years 10 months ago
Efficient Distributed Detection of Node Replication Attacks in Sensor Networks
Wireless sensor nodes lack hardware support for tamperresistance and are often deployed in unattended environments, thus leaving them vulnerable to capture and compromise by an ad...
Bo Zhu, Venkata Gopala Krishna Addada, Sanjeev Set...
165
Voted
IJCAI
2007
15 years 7 months ago
Sequential Bundle-Bid Single-Sale Auction Algorithms for Decentralized Control
We study auction-like algorithms for the distributed allocation of tasks to cooperating agents. To reduce the team cost of sequential single-item auction algorithms, we generalize...
Sven Koenig, Craig A. Tovey, Xiaoming Zheng, Ilgaz...
179
Voted
WICON
2008
15 years 7 months ago
A graph based routing algorithm for multi-hop cognitive radio networks
Cognitive radio networks that allow dynamic spectrum access are considered spectrally more efficient than networks using fixed spectral allocation. These networks are characterize...
Yogesh Reddy Kondareddy, Prathima Agrawal
CORR
2008
Springer
97views Education» more  CORR 2008»
15 years 6 months ago
Efficient Algorithms and Routing Protocols for Handling Transient Single Node Failures
Single node failures represent more than 85% of all node failures in the today's large communication networks such as the Internet [10]. Also, these node failures are usually...
Amit M. Bhosle, Teofilo F. Gonzalez