18306 search results - page 260 / 3662 » Algorithmics in Exponential Time |
154
click to vote
ATVA
2004
Springer
15 years 12 months ago
2004
Springer
This paper proposes a partial order reduction algorithm for timed trace theoretic verification in order to detect both safety failures and timing failures of timed circuits effic...
148
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
nalysis of a TA modeled component. First, we abstract fine models to work with event streams at coarse granularity. We perform analysis of the component at multiple coarse granular...
154
Voted
WDAG
2007
Springer
16 years 17 days ago
2007
Springer
The paper presents a deterministic distributed algorithm that given an n node unweighted graph constructs an O(n3/2 ) edge 3-spanner for it in O(log n) time. This algorithm is the...
166
click to vote
ICTAC
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Regular expressions with numerical constraints are an extension of regular expressions, allowing to bound numerically the number of times that a subexpression should be m...
168
click to vote
UC
2009
Springer
16 years 1 months ago
2009
Springer
Membrane systems with dividing and dissolving membranes are known to solve PSPACE problems in polynomial time. However, we give a P upperbound on an important restriction of such s...