Sciweavers

7262 search results - page 31 / 1453
» Reversible Computer Hardware
Sort
View
CORR
2006
Springer
98views Education» more  CORR 2006»
14 years 9 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
JCB
2007
78views more  JCB 2007»
14 years 9 months ago
Sorting by Reciprocal Translocations via Reversals Theory
The understanding of genome rearrangements is an important endeavor in comparative genomics. A major computational problem in this field is finding a shortest sequence of genome...
Michal Ozery-Flato, Ron Shamir
JCB
2002
102views more  JCB 2002»
14 years 9 months ago
A Lower Bound on the Reversal and Transposition Diameter
One possible model to study genome evolution is to represent genomes as permutations of genes and compute distances based on the minimum number of certain operations (rearrangemen...
João Meidanis, Maria Emilia Telles Walter, ...
JAPLL
2008
91views more  JAPLL 2008»
14 years 9 months ago
Undoing the effects of action sequences
In this paper, we study the following basic problem: After having executed a sequence of actions, find a sequence of actions that brings the agent back to the state just before th...
Thomas Eiter, Esra Erdem, Wolfgang Faber
ENGL
2007
88views more  ENGL 2007»
14 years 9 months ago
Computer Simulated Tests for Lever Controls with Circular Displays
— Using computer simulated tests, this study examined direction-of-motion stereotypes and response times for different configurations of lever controls and circular displays. Qua...
W. H. Chan, Alan H. S. Chan