Sciweavers

944 search results - page 163 / 189
» A Survey on Counting Networks
Sort
View
CAP
2010
14 years 9 months ago
Parallel disk-based computation for large, monolithic binary decision diagrams
Binary Decision Diagrams (BDDs) are widely used in formal verification. They are also widely known for consuming large amounts of memory. For larger problems, a BDD computation wi...
Daniel Kunkle, Vlad Slavici, Gene Cooperman
COMPSAC
2011
IEEE
14 years 1 months ago
Precise Propagation of Fault-Failure Correlations in Program Flow Graphs
Abstract—Statistical fault localization techniques find suspicious faulty program entities in programs by comparing passed and failed executions. Existing studies show that such ...
Zhenyu Zhang, W. K. Chan, T. H. Tse, Bo Jiang
LOCA
2005
Springer
15 years 7 months ago
Classifying the Mobility of Users and the Popularity of Access Points
Abstract. There is increasing interest in location-aware systems and applications. It is important for any designer of such systems and applications to understand the nature of use...
Minkyong Kim, David Kotz
CCR
2002
99views more  CCR 2002»
15 years 1 months ago
Implementation experience with MANET routing protocols
This paper outlines our experience with the implementation and deployment of two MANET routing protocols on a five node, four hop, network. The work was prompted by the lack of pu...
Kwan Wu Chin, John Judge, Aidan Williams, Roger Ke...
TON
2002
99views more  TON 2002»
15 years 1 months ago
Computing shortest paths for any number of hops
In this paper we introduce and investigate a new" path optimization problem which we denote as the All Hops Optimal Path AHOP problem. The problem involves identifying, for a...
Roch Guérin, Ariel Orda