Sciweavers

18306 search results - page 23 / 3662
» Algorithmics in Exponential Time
Sort
View
CORR
2011
Springer
159views Education» more  CORR 2011»
13 years 2 months ago
Solving connectivity problems parameterized by treewidth in single exponential time
Marek Cygan, Jesper Nederlof, Marcin Pilipczuk, Mi...
ICALP
2010
Springer
13 years 9 months ago
Parameterized Modal Satisfiability
We investigate the parameterized computational complexity of the satisfiability problem for modal logic and attempt to pinpoint relevant structural parameters which cause the probl...
Antonis Achilleos, Michael Lampis, Valia Mitsou
ADAEUROPE
2007
Springer
14 years 1 months ago
Static Detection of Livelocks in Ada Multitasking Programs
Abstract. In this paper we present algorithms to statically detect livelocks in Ada multitasking programs. Although the algorithms’ worst-case execution time is exponential, they...
Johann Blieberger, Bernd Burgstaller, Robert Mitte...
AAECC
2005
Springer
131views Algorithms» more  AAECC 2005»
13 years 7 months ago
Noisy interpolation of sparse polynomials in finite fields
Abstract We consider a polynomial analogue of the hidden number problem introduced by Boneh andVenkatesan, namely the sparse polynomial noisy interpolation problem of recovering an...
Igor Shparlinski, Arne Winterhof
SP
1996
IEEE
101views Security Privacy» more  SP 1996»
13 years 12 months ago
An Immunological Approach to Change Detection: Algorithms, Analysis and Implications
We present new results on a distributable changedetection method inspired by the natural immune system. A weakness in the original algorithm was the exponential cost of generating...
Patrik D'haeseleer, Stephanie Forrest, Paul Helman