Sciweavers

18306 search results - page 41 / 3662
» Algorithmics in Exponential Time
Sort
View
ICDT
2007
ACM
141views Database» more  ICDT 2007»
15 years 3 months ago
Exact XML Type Checking in Polynomial Time
Stay macro tree transducers (smtts) are an expressive formalism for reasoning about XSLT-like document transformations. Here, we consider the exact type checking problem for smtts....
Sebastian Maneth, Thomas Perst, Helmut Seidl
HYBRID
1994
Springer
15 years 1 months ago
Symbolic Controller Synthesis for Discrete and Timed Systems
This paper presents algorithms for the symbolic synthesis of discrete and real-time controllers. At the semantic level the controller is synthesized by nding a winning strategy for...
Eugene Asarin, Oded Maler, Amir Pnueli
AAAI
1998
14 years 11 months ago
A Tractable Walsh Analysis of SAT and its Implications for Genetic Algorithms
Walsh Transforms measure all sources of nonlinear interactions for functions that have a bit representation. There can be exponentially many nonlinear interactions and exactly com...
Soraya B. Rana, Robert B. Heckendorn, L. Darrell W...
EOR
2008
88views more  EOR 2008»
14 years 9 months ago
Algorithmic analysis of the Geo/Geo/c
In this paper, we consider a discrete-time queue of Geo/Geo/c type with geometric repeated attempts. It is known that its continuous counterpart, namely the M/M/c queue with expon...
Jesus R. Artalejo, Antonis Economou, Antonio G&oac...
CTRSA
2009
Springer
127views Cryptology» more  CTRSA 2009»
15 years 4 months ago
Securing RSA against Fault Analysis by Double Addition Chain Exponentiation
Abstract. Fault Analysis is a powerful cryptanalytic technique that enables to break cryptographic implementations embedded in portable devices more efficiently than any other tech...
Matthieu Rivain