Sciweavers

392 search results - page 1 / 79
» Reversal Complexity Revisited
Sort
View
CORR
2006
Springer
98views Education» more  CORR 2006»
13 years 4 months ago
Reversal Complexity Revisited
We study a generalized version of reversal bounded Turing machines where, apart from several tapes on which the number of head reversals is bounded by r(n), there are several furth...
André Hernich, Nicole Schweikardt
WCRE
2000
IEEE
13 years 9 months ago
Revisiting the Delta IC Approach to Component Recovery
Component recovery supports program understanding, architecture recovery, and re-use. Among the best known techniques for detection of re-usable objects (related global variables ...
Gerardo Canfora, Jörg Czeranski, Rainer Kosch...
DAC
2004
ACM
14 years 5 months ago
A new heuristic algorithm for reversible logic synthesis
Reversible logic has applications in many fields, including quantum computing. Synthesis techniques for reversible circuits are not well developed, even for functions with a small...
Pawel Kerntopf
RECOMB
2010
Springer
13 years 2 months ago
Listing All Parsimonious Reversal Sequences: New Algorithms and Perspectives
In comparative genomics studies, finding a minimum length sequences of reversals, so called sorting by reversals, has been the topic of a huge literature. Since there are many mini...
Ghada Badr, Krister M. Swenson, David Sankoff
NMR
2004
Springer
13 years 10 months ago
Plan reversals for recovery in execution monitoring
In this paper, we introduce a new method to recover from discrepancies in a general monitoring framework where the agent finds some explanations (points of failure) for discrepan...
Thomas Eiter, Esra Erdem, Wolfgang Faber