26 search results - page 2 / 6 » How to Achieve an Equivalent Simple Permutation in Linear Ti... |
LATIN
2010
Springer
13 years 11 months ago
2010
Springer
Topological self-stabilization is an important concept to build robust open distributed systems (such as peer-to-peer systems) where nodes can organize themselves into meaningful n...
ICFP
2007
ACM
14 years 4 months ago
2007
ACM
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
ICECCS
1998
IEEE
13 years 9 months ago
1998
IEEE
The main focus of this paper is the problem of ensuring timeliness in safety critical systems. First, we introduce a method and its associated technique to model both real-time ta...
CORR
2002
Springer
13 years 4 months ago
2002
Springer
Dealing with the NP-complete Dominating Set problem on graphs, we demonstrate the power of data reduction by preprocessing from a theoretical as well as a practical side. In parti...
CIIT
2007
13 years 6 months ago
2007
Given a list of filtering rules with individual hitting probabilities, it is known that the average processing time of a linear-search based firewall can be minimized by searchi...