Sciweavers

713 search results - page 42 / 143
» Toward a More Reliable Theory of Software Reliability
Sort
View
DATE
2009
IEEE
92views Hardware» more  DATE 2009»
14 years 3 months ago
Using randomization to cope with circuit uncertainty
—Future computing systems will feature many cores that run fast, but might show more faults compared to existing CMOS technologies. New software methodologies must be adopted to ...
Hamid Safizadeh, Mohammad Tahghighi, Ehsan K. Arde...
POPL
2005
ACM
14 years 9 months ago
Mutatis mutandis: safe and predictable dynamic software updating
Dynamic software updates can be used to fix bugs or add features to a running program without downtime. Essential for some applications and convenient for others, low-level dynami...
Gareth Stoyle, Michael W. Hicks, Gavin M. Bierman,...
CORR
2007
Springer
126views Education» more  CORR 2007»
13 years 8 months ago
Rethinking Information Theory for Mobile Ad Hoc Networks
The subject of this article is the long standing open problem of developing a general capacity theory for wireless networks, particularly a theory capable of describing the fundam...
Jeffrey G. Andrews, Nihar Jindal, Martin Haenggi, ...
BMCBI
2008
128views more  BMCBI 2008»
13 years 8 months ago
Efficient computation of absent words in genomic sequences
Background: Analysis of sequence composition is a routine task in genome research. Organisms are characterized by their base composition, dinucleotide relative abundance, codon us...
Julia Herold, Stefan Kurtz, Robert Giegerich
SIGCOMM
2010
ACM
13 years 8 months ago
Theory and new primitives for safely connecting routing protocol instances
Recent studies have shown that the current primitives for connecting multiple routing protocol instances (OSPF 1, OSPF 2, EIGRP 10, etc.) are pervasively deployed in enterprise ne...
Franck Le, Geoffrey G. Xie, Hui Zhang