Sciweavers

22 search results - page 4 / 5
» When Is Reachability Intrinsically Decidable
Sort
View
JCIT
2008
103views more  JCIT 2008»
13 years 5 months ago
Implementation of Filter Reverse Search System based on Spatial Relationships of Filters
Firewall is a useful technique that ensures network security. Firewall examines network packets and determines whether to accept or deny them based on an ordered set of filters. I...
Yi Yin, Kazuaki Hida, Yoshiaki Katayama, Naohisa T...
CADE
2005
Springer
14 years 6 months ago
Temporal Logics over Transitive States
Abstract. We investigate the computational behaviour of `two-dimensional' propositional temporal logics over (N, <) (with and without the next-time operator ?) that are cap...
Boris Konev, Frank Wolter, Michael Zakharyaschev
STOC
2001
ACM
123views Algorithms» more  STOC 2001»
14 years 6 months ago
On optimal slicing of parallel programs
Optimal program slicing determines for a statement S in a program whether or not S affects a specified set of statements, given that all conditionals in are interpreted as non-d...
Markus Müller-Olm, Helmut Seidl
INFOCOM
2006
IEEE
13 years 11 months ago
Wealth-Based Evolution Model for the Internet AS-Level Topology
— In this paper, we seek to understand the intrinsic reasons for the well-known phenomenon of heavy-tailed degree in the Internet AS graph and argue that in contrast to tradition...
Xiaoming Wang, Dmitri Loguinov
TON
2010
83views more  TON 2010»
13 years 4 months ago
Understanding and modeling the internet topology: economics and evolution perspective
Abstract—In this paper, we seek to understand the intrinsic reasons for the well-known phenomenon of heavy-tailed degree in the Internet AS graph and argue that in contrast to tr...
Xiaoming Wang, Dmitri Loguinov