2467 search results - page 134 / 494 » Finite State Machines |
144
click to vote
IEICET
2007
15 years 6 months ago
2007
Bursty traffic is dominant in modern communication networks and keeps the call-level QoS assessment an open issue. ON-OFF traffic models are commonly used to describe bursty tra...
189
click to vote
APSEC
1998
IEEE
15 years 10 months ago
1998
IEEE
This paper describes an automated approach to generating test cases for an object-oriented class. The approach is derived from state-based testing methods and refers to a state ma...
168
click to vote
ICCAD
1999
IEEE
15 years 10 months ago
1999
IEEE
In this paper, an internal design model called FunState (functions driven by state machines) is presented that enables the representation of different types of system components a...
157
click to vote
DLT
2006
15 years 8 months ago
2006
By weakly ambiguous (finite) transducers we mean those transducers that, although being ambiguous, may be viewed to be at arm's length from unambiguity. We define input-unambi...
156
click to vote
CCA
2005
Springer
15 years 8 months ago
2005
Springer
If one wishes to find out whether a computational problem over discrete data is solvable or how complex it is, the classical approach is to represent the discrete objects in quest...