Sciweavers

33 search results - page 3 / 7
» On Algorithm for All-Pairs Most Reliable Quickest Paths
Sort
View
POPL
2007
ACM
14 years 7 months ago
Preferential path profiling: compactly numbering interesting paths
Path profiles provide a more accurate characterization of a program's dynamic behavior than basic block or edge profiles, but are relatively more expensive to collect. This h...
Kapil Vaswani, Aditya V. Nori, Trishul M. Chilimbi
DAC
2008
ACM
14 years 8 months ago
On the role of timing masking in reliable logic circuit design
Soft errors, once only of concern in memories, are beginning to affect logic as well. Determining the soft error rate (SER) of a combinational circuit involves three main masking ...
Smita Krishnaswamy, Igor L. Markov, John P. Hayes
FOIKS
2004
Springer
14 years 13 days ago
Query Answering and Containment for Regular Path Queries under Distortions
Abstract. We give a general framework for approximate query processing in semistructured databases. We focus on regular path queries, which are the integral part of most of the que...
Gösta Grahne, Alex Thomo
PPSN
2004
Springer
14 years 12 days ago
AntHocNet: An Ant-Based Hybrid Routing Algorithm for Mobile Ad Hoc Networks
In this paper we present AntHocNet, a new algorithm for routing in mobile ad hoc networks. Due to the ever changing topology and limited bandwidth it is very hard to establish and ...
Gianni Di Caro, Frederick Ducatelle, Luca Maria Ga...
IFIP
2007
Springer
14 years 1 months ago
A Novel Loop-Free IP Fast Reroute Algorithm
Although providing reliable network services is getting more and more important, currently used methods in IP networks are typically reactive and error correcting can take a long t...
Gábor Enyedi, Gábor Rétv&aacu...