7311 search results - page 160 / 1463 » Time in State Machines |
157
click to vote
CHARME
1995
Springer
15 years 8 months ago
1995
Springer
In this paper we present a method formodeling asynchronous digital circuits by timed automata. The constructed timed automata serve as \mechanical" and veri able objects for a...
141
click to vote
ORL
2002
15 years 4 months ago
2002
We consider on-line scheduling of unit time jobs on a single machine with job-dependent penalties. The jobs arrive on-line (one by one) and can be either accepted and scheduled, o...
129
click to vote
ECML
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. We investigate the problem of using function approximation in reinforcement learning where the agent’s policy is represented as a classifier mapping states to actions....
133
click to vote
ACL
2012
13 years 7 months ago
2012
We propose a novel heuristic algorithm for Cube Pruning running in linear time in the beam size. Empirically, we show a gain in running time of a standard machine translation syst...
140
click to vote
DISOPT
2008
15 years 4 months ago
2008
We study the problem of minimizing total latency in machine scheduling with deliveries, which is defined as follows. There is a set of n jobs to be processed by a single machine a...