Sciweavers

283 search results - page 21 / 57
» A New DNA Implementation of Finite State Machines
Sort
View
BMCBI
2002
131views more  BMCBI 2002»
13 years 7 months ago
Efficient Boolean implementation of universal sequence maps (bUSM)
Background: Recently, Almeida and Vinga offered a new approach for the representation of arbitrary discrete sequences, referred to as Universal Sequence Maps (USM), and discussed ...
John Schwacke, Jonas S. Almeida
PTS
2007
81views Hardware» more  PTS 2007»
13 years 9 months ago
An EFSM-Based Passive Fault Detection Approach
Extended Finite State Machine (EFSM)-based passive fault detection involves modeling the system under test (SUT) as an EFSM M, monitoring the input/output behaviors of the SUT, and...
Hasan Ural, Zhi Xu
BMCBI
2007
153views more  BMCBI 2007»
13 years 7 months ago
Analysis of nanopore detector measurements using Machine-Learning methods, with application to single-molecule kinetic analysis
Background: A nanopore detector has a nanometer-scale trans-membrane channel across which a potential difference is established, resulting in an ionic current through the channel ...
Matthew Landry, Stephen Winters-Hilt
EUROSYS
2006
ACM
14 years 4 months ago
The SMART way to migrate replicated stateful services
Many stateful services use the replicated state machine approach for high availability. In this approach, a service runs on multiple machines to survive machine failures. This pap...
Jacob R. Lorch, Atul Adya, William J. Bolosky, Ron...
ICCAD
1999
IEEE
84views Hardware» more  ICCAD 1999»
14 years 5 hour ago
OPTIMISTA: state minimization of asynchronous FSMs for optimum output logic
The optimal state minimization problem is to select a reduced state machine having the best logic implementation over all possible state reductions and encodings. A recent algorit...
Robert M. Fuhrer, Steven M. Nowick