Sciweavers

1289 search results - page 235 / 258
» Complexity of Counting the Optimal Solutions
Sort
View
CLUSTER
2007
IEEE
15 years 4 months ago
Evaluation of fault-tolerant policies using simulation
— Various mechanisms for fault-tolerance (FT) are used today in order to reduce the impact of failures on application execution. In the case of system failure, standard FT mechan...
Anand Tikotekar, Geoffroy Vallée, Thomas Na...
APN
2008
Springer
14 years 11 months ago
Hierarchical Set Decision Diagrams and Automatic Saturation
Shared decision diagram representations of a state-space have been shown to provide efficient solutions for model-checking of large systems. However, decision diagram manipulation ...
Alexandre Hamez, Yann Thierry-Mieg, Fabrice Kordon
PDPTA
2004
14 years 11 months ago
Efficient Disk Replacement and Data Migration Algorithms for Large Disk Subsystems
Random data placement has recently emerged as an alternative to traditional data striping. From a performance perspective, it has been demonstrated to be an efficient and scalable...
Roger Zimmermann, Beomjoo Seo
TON
2010
197views more  TON 2010»
14 years 8 months ago
Constrained relay node placement in wireless sensor networks: formulation and approximations
—One approach to prolong the lifetime of a wireless sensor network (WSN) is to deploy some relay nodes to communicate with the sensor nodes, other relay nodes, and the base stati...
Satyajayant Misra, Seung Don Hong, Guoliang Xue, J...
97
Voted
MOBIHOC
2008
ACM
15 years 9 months ago
Construction algorithms for k-connected m-dominating sets in wireless sensor networks
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...
Yiwei Wu, Yingshu Li