7311 search results - page 135 / 1463 » Time in State Machines |
142
click to vote
COLT
1995
Springer
15 years 8 months ago
1995
Springer
We propose and analyze a distribution learning algorithm for a subclass of Acyclic Probabilistic Finite Automata (APFA). This subclass is characterized by a certain distinguishabi...
134
click to vote
ISSTA
2004
ACM
15 years 9 months ago
2004
ACM
This paper deals with testing of nondeterministic software systems. We assume that a model of the nondeterministic system is given by a directed graph with two kind of vertices: s...
137
click to vote
ACRI
2004
Springer
15 years 9 months ago
2004
Springer
We have investigated a problem where the goal is to find automatically the best rule for a cell in the cellular automata model. The cells are either of type OBSTACLE, EMPTY or CRE...
149
click to vote
ICFEM
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. The success of industrial-scale model checkers such as Uppaal [3] or NuSMV [12] relies on the efficiency of their respective symbolic state space representations. While d...
124
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
We study the problem of preemptive scheduling n jobs with given release times on m identical parallel machines. The objective is to minimize the average flow time. We show that wh...