Sciweavers

1391 search results - page 169 / 279
» Complexity Limitations on Quantum Computation
Sort
View
NOCS
2008
IEEE
14 years 2 months ago
Reducing the Interconnection Network Cost of Chip Multiprocessors
This paper introduces a cost-effective technique to deal with CMP coherence protocol requirements from the interconnection network point of view. A mechanism is presented to avoid...
Pablo Abad, Valentin Puente, José-Án...
RTSS
2008
IEEE
14 years 2 months ago
Fast Sensor Placement Algorithms for Fusion-Based Target Detection
Mission-critical target detection imposes stringent performance requirements for wireless sensor networks, such as high detection probabilities and low false alarm rates. Data fus...
Zhaohui Yuan, Rui Tan, Guoliang Xing, Chenyang Lu,...
ADHOCNOW
2008
Springer
14 years 2 months ago
Geographic Routing with Early Obstacles Detection and Avoidance in Dense Wireless Sensor Networks
Existing geographic routing algorithms for sensor networks are mainly concerned with finding a path toward a destination, without explicitly addressing the impact of obstacles on ...
Luminita Moraru, Pierre Leone, Sotiris E. Nikolets...
AINA
2007
IEEE
14 years 2 months ago
Leveraging Identity-Based Cryptography for Node ID Assignment in Structured P2P Systems
Abstract— Structured peer-to-peer systems have grown enormously because of their scalability, efficiency and reliability. These systems assign a unique identifier to each user ...
Sunam Ryu, Kevin R. B. Butler, Patrick Traynor, Pa...
DSN
2007
IEEE
14 years 2 months ago
Dynamic Fault Tree Analysis Using Input/Output Interactive Markov Chains
Dynamic Fault Trees (DFT) extend standard fault trees by allowing the modeling of complex system components’ behaviors and interactions. Being a high level model and easy to use...
Hichem Boudali, Pepijn Crouzen, Mariëlle Stoe...