121 search results - page 2 / 25 » Using adaptive distinguishing sequences in checking sequence... |
ISCIS
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. Based on a distinguishing sequence for a Finite State Machine (FSM), an efficient checking sequence may be produced from the elements of a set Eα of α –sequences and ...
ASE
2006
13 years 5 months ago
2006
Finite state machines have been used to model a number of classes of system and there has thus been much interest in the automatic generation of test sequences from finite state m...
IJCAI
1993
13 years 6 months ago
1993
One of the open problems listed in Rivest and Schapire, 1989] is whether and how that the copies of L in their algorithm can be combined into one for better performance. This pape...
ISCIS
2009
Springer
13 years 11 months ago
2009
Springer
—Methods for software testing based on Finite State Machines (FSMs) have been researched since the early 60’s. Many of these methods are about generating a checking sequence fr...
BMCBI
2007
13 years 5 months ago
2007
Background: Construction and interpretation of phylogenetic trees has been a major research topic for understanding the evolution of genes. Increases in sequence data and complexi...