7311 search results - page 126 / 1463 » Time in State Machines |
162
click to vote
KBSE
2000
IEEE
15 years 8 months ago
2000
IEEE
The majority of work carried out in the formal methods community throughout the last three decades has (for good reasons) been devoted to special languages designed to make it eas...
168
click to vote
ESA
1999
Springer
15 years 8 months ago
1999
Springer
We give a polynomial approximation scheme for the problem of scheduling on uniformly related parallel machines for a large class of objective functions that depend only on the mac...
128
click to vote
APIN
1999
15 years 4 months ago
1999
We present a method for mapping a given Bayesian network to a Boltzmann machine architecture, in the sense that the the updating process of the resulting Boltzmann machine model pr...
115
click to vote
CIE
2009
Springer
15 years 11 months ago
2009
Springer
computability uses ordinals instead of natural numbers in abstract machines like register or Turing machines. We give an overview of the computational strengths of α-β-machines,...
108
click to vote
WSC
2000
15 years 5 months ago
2000
An advanced processing machine interacts with the material handling system, personnel and cell or shop floor controller in real-time via messaging and control. However, current si...