Sciweavers

1941 search results - page 154 / 389
» On Generalizations of Network Design Problems with Degree Bo...
Sort
View
EUROCRYPT
2005
Springer
16 years 16 days ago
Computational Indistinguishability Between Quantum States and Its Cryptographic Application
We introduce a computational problem of distinguishing between two specific quantum states as a new cryptographic problem to design a quantum cryptographic scheme that is “secu...
Akinori Kawachi, Takeshi Koshiba, Harumichi Nishim...
ATAL
2003
Springer
16 years 7 days ago
Continual coordination through shared activities
Interacting agents that interleave planning and execution must reach consensus on their commitments to each other. In domains where agents have varying degrees of interaction and ...
Bradley J. Clement, Anthony C. Barrett
MSWIM
2006
ACM
16 years 29 days ago
An application-driven perspective on wireless sensor network security
Wireless sensor networks (WSNs) have recently attracted a lot of interest due to the range of applications they enable. Unfortunately, WSNs are exposed to numerous security threat...
Eric Sabbah, Adnan Majeed, Kyoung-Don Kang, Ke Liu...
NETWORK
2006
84views more  NETWORK 2006»
15 years 7 months ago
VON: a scalable peer-to-peer network for virtual environments
: The scalability of large-scale networked virtual environments (NVEs) suchastoday's Massively Multiplayer Online Games (MMOGs) faces inherent limits imposed by the client-ser...
Shun-Yun Hu, Jui-Fa Chen, Tsu-Han Chen
INFOCOM
2010
IEEE
15 years 5 months ago
Markov Approximation for Combinatorial Network Optimization
—Many important network design problems can be formulated as a combinatorial optimization problem. A large number of such problems, however, cannot readily be tackled by distribu...
Minghua Chen, Soung Chang Liew, Ziyu Shao, Caihong...