72 search results - page 3 / 15 » Succinct Representations of Separable Graphs |
CAV
1999
Springer
13 years 10 months ago
1999
Springer
Abstract. In this paper we extend one of the main tools used in veri cation of discrete systems, namely Binary Decision Diagrams (BDD), to treat probabilistic transition systems. W...
ESOP
2010
Springer
14 years 3 months ago
2010
Springer
Detailed memory models that expose individual fields are necessary to precisely analyze code that makes use of low-level aspects such as, pointers to fields and untagged unions. Ye...
ALENEX
2004
13 years 7 months ago
2004
In previous work we described a method for compactly representing graphs with small separators, which makes use of small separators, and presented preliminary experimental results...
ADHOCNOW
2008
Springer
14 years 3 days ago
2008
Springer
Abstract. This paper presents an algorithm for constructing a spanner for ad hoc networks whose nodes have variable transmission range. Almost all previous spanner constructions fo...
CACM
2006
13 years 5 months ago
2006
ional thinking is using abstraction and decomposition when attacking a large complex task or designing a large complex system. It is separation of concerns. It is choosing an appro...