Sciweavers

5183 search results - page 926 / 1037
» The Complexity of Distributions
Sort
View
ICC
2011
IEEE
201views Communications» more  ICC 2011»
14 years 6 months ago
Survivable Optical Grid Dimensioning: Anycast Routing with Server and Network Failure Protection
Abstract—Grids can efficiently deal with challenging computational and data processing tasks which cutting edge science is generating today. So-called e-Science grids cope with ...
Chris Develder, Jens Buysse, Ali Shaikh, Brigitte ...
TMC
2010
130views more  TMC 2010»
15 years 4 months ago
SYNAPSE++: Code Dissemination in Wireless Sensor Networks Using Fountain Codes
—This paper presents SYNAPSE++, a system for over the air reprogramming of wireless sensor networks (WSNs). In contrast to previous solutions, which implement plain negative ackn...
Michele Rossi, Nicola Bui, Giovanni Zanca, Luca St...
ISPD
2012
ACM
288views Hardware» more  ISPD 2012»
14 years 1 months ago
Construction of realistic gate sizing benchmarks with known optimal solutions
Gate sizing in VLSI design is a widely-used method for power or area recovery subject to timing constraints. Several previous works have proposed gate sizing heuristics for power ...
Andrew B. Kahng, Seokhyeong Kang
ATAL
2009
Springer
16 years 28 days ago
Computational aspects of Shapley's saddles
Game-theoretic solution concepts, such as Nash equilibrium, are playing an ever increasing role in the study of systems of autonomous computational agents. A common criticism of N...
Felix Brandt, Markus Brill, Felix A. Fischer, Paul...
CCS
2009
ACM
16 years 1 months ago
Keep your friends close: the necessity for updating an anomaly sensor with legitimate environment changes
Large-scale distributed systems have dense, complex code-bases that are assumed to perform multiple and inter-dependent tasks while user interaction is present. The way users inte...
Angelos Stavrou, Gabriela F. Cretu-Ciocarlie, Mich...