Sciweavers

806 search results - page 127 / 162
» Lower Bounds on Correction Networks
Sort
View
PODC
2011
ACM
13 years 1 months ago
Robust network supercomputing without centralized control
Internet supercomputing is becoming an increasingly popular means for harnessing the power of a vast number of interconnected computers. This comes at a cost substantially lower t...
Seda Davtyan, Kishori M. Konwar, Alexander A. Shva...
MOBICOM
2009
ACM
14 years 4 months ago
Lifetime and coverage guarantees through distributed coordinate-free sensor activation
Wireless Sensor Networks are emerging as a key sensing technology, with diverse military and civilian applications. In these networks, a large number of sensors perform distribute...
Gaurav S. Kasbekar, Yigal Bejerano, Saswati Sarkar
INFOCOM
2008
IEEE
14 years 4 months ago
Randomized 3D Geographic Routing
—We reconsider the problem of geographic routing in wireless ad hoc networks. We are interested in local, memoryless routing algorithms, i.e. each network node bases its routing ...
Roland Flury, Roger Wattenhofer
SPIN
2007
Springer
14 years 4 months ago
Generating Counter-Examples Through Randomized Guided Search
Abstract. Computational resources are increasing rapidly with the explosion of multi-core processors readily available from major vendors. Model checking needs to harness these res...
Neha Rungta, Eric G. Mercer
DAC
2010
ACM
14 years 2 months ago
LUT-based FPGA technology mapping for reliability
As device size shrinks to the nanometer range, FPGAs are increasingly prone to manufacturing defects. We anticipate that the ability to tolerate multiple defects will be very impo...
Jason Cong, Kirill Minkovich