Sciweavers

6939 search results - page 1106 / 1388
» Algorithm Engineering for Parallel Computation
Sort
View
ICDCN
2011
Springer
14 years 7 months ago
Load Balanced Scalable Byzantine Agreement through Quorum Building, with Full Information
We address the problem of designing distributed algorithms for large scale networks that are robust to Byzantine faults. We consider a message passing, full information model: the ...
Valerie King, Steven Lonargan, Jared Saia, Amitabh...
PODC
2011
ACM
14 years 7 months ago
Locally checkable proofs
This work studies decision problems from the perspective of nondeterministic distributed algorithms. For a yes-instance there must exist a proof that can be verified with a distri...
Mika Göös, Jukka Suomela
DAC
2011
ACM
14 years 4 months ago
Thermal-aware cell and through-silicon-via co-placement for 3D ICs
Existing thermal-aware 3D placement methods assume that the temperature of 3D ICs can be optimized by properly distributing the power dissipations, and ignoring the heat conductiv...
Jason Cong, Guojie Luo, Yiyu Shi
ISAAC
2003
Springer
91views Algorithms» more  ISAAC 2003»
15 years 9 months ago
Quantum Merlin-Arthur Proof Systems: Are Multiple Merlins More Helpful to Arthur?
This paper introduces quantum “multiple-Merlin”-Arthur proof systems in which Arthur receives multiple quantum proofs that are unentangled with each other. Although classical ...
Hirotada Kobayashi, Keiji Matsumoto, Tomoyuki Yama...
TASE
2010
IEEE
14 years 11 months ago
Robust Calibration for Localization in Clustered Wireless Sensor Networks
This paper presents a robust calibration procedure for clustered wireless sensor networks. Accurate calibration of between-node distances is one crucial step in localizing sensor n...
Jung Jin Cho, Yu Ding, Yong Chen, Jiong Tang
« Prev « First page 1106 / 1388 Last » Next »