7311 search results - page 305 / 1463 » Time in State Machines |
294
click to vote
KESAMSTA
2011
Springer
14 years 10 months ago
2011
Springer
Creating modular behaviours in JADE using a traditional method such as the FSM (Finite State Machine) can be a difficult task to achieve. The first issue with FSMs is that they do...
133
click to vote
EOR
2002
15 years 7 months ago
2002
Abstract. We present fully polynomial approximation schemes for the problem of minimizing completion time variance of a set of n jobs on a single machine. The fastest of these sche...
167
click to vote
COLT
2004
Springer
16 years 25 days ago
2004
Springer
We give the first polynomial time prediction strategy for any PAC-learnable class C that probabilistically predicts the target with mistake probability poly(log(t)) t = ˜O 1 t w...
173
click to vote
COR
2007
15 years 7 months ago
2007
This paper studies the two-machine permutation flowshop scheduling problem with anticipatory setup times and an availability constraint imposed only on the first machine. The obje...
167
click to vote
DATE
2006
IEEE
16 years 1 months ago
2006
IEEE
This paper presents a Java processor, called JOP, designed for time-predictable execution of real-time tasks. JOP is the implementation of the Java virtual machine in hardware. We...