537 search results - page 63 / 108 » A new upper bound for 3-SAT |
171
click to vote
FSTTCS
2007
Springer
16 years 9 days ago
2007
Springer
Abstract. This paper proposes a new algorithm that improves the complexity bound for solving parity games. Our approach combines McNaughton’s iterated fixed point algorithm with...
161
click to vote
ICALP
2007
Springer
16 years 9 days ago
2007
Springer
Abstract. The edit distance between two ordered rooted trees with vertex labels is the minimum cost of transforming one tree into the other by a sequence of elementary operations c...
144
click to vote
QEST
2006
IEEE
16 years 4 days ago
2006
IEEE
We analyze the effect of a few fiber delay loops on the number of deflections in an all optical packet switch. The switch is based on the ROMEO architecture developed by Alcatel...
156
click to vote
WADS
2005
Springer
15 years 11 months ago
2005
Springer
Let G be an embedded planar graph whose edges may be curves. The detour between two points, p and q (on edges or vertices) of G, is the ratio between the shortest path in G between...
163
click to vote
DAC
2004
ACM
15 years 10 months ago
2004
ACM
In a CMOS combinational logic circuit, the subthreshold leakage current in the standby state depends on the state of the inputs. In this paper we present a new approach to identif...