1146 search results - page 117 / 230 » Finite cupping sets |
ISCIS
2005
Springer
14 years 3 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 ...
ADAEUROPE
2001
Springer
14 years 2 months ago
2001
Springer
Deriving test cases from specifications is now recognised as a major application of formal methods to software development. Several methods have been proposed for various formalism...
CIE
2009
Springer
14 years 2 months ago
2009
Springer
An arithmetic circuit is a labelled, directed, acyclic graph specifying a cascade of arithmetic and logical operations to be performed on sets of non-negative integers. In this pap...
ALT
2010
Springer
13 years 11 months ago
2010
Springer
Many algorithms for grammatical inference can be viewed as instances of a more general algorithm which maintains a set of primitive elements, which distributionally define sets of ...
AAAI
2010
13 years 11 months ago
2010
This paper presents a technique for approximating, up to any precision, the set of subgame-perfect equilibria (SPE) in repeated games with discounting. The process starts with a s...