7311 search results - page 106 / 1463 » Time in State Machines |
138
click to vote
MOR
2000
15 years 3 months ago
2000
We consider the problem of scheduling a set of n jobs on m identical parallel machines so as to minimize the weighted sum of job completion times. This problem is NP-hard in the s...
150
click to vote
STACS
1999
Springer
15 years 8 months ago
1999
Springer
The paper gives a logical characterisation of the class NTIME(n) of problems that can be solved on a nondeterministic Turing machine in linear time. It is shown that a set L of str...
118
Voted
SCP
1998
15 years 3 months ago
1998
In STOC 93, Jones sketched the existence of a hierarchy within problems decidable in linear time by a first-order functional language based on tree-structured data (F), as well a...
ICPR
2004
IEEE
16 years 5 months ago
2004
IEEE
1 We present a high speed machine vision system for the inspection and quality assurance of canned tuna, which is currently working at a rate over 1000 cans per minute. The system ...
137
click to vote
COR
2010
15 years 4 months ago
2010
This paper presents different methods for solving parallel machine scheduling problems with precedence constraints and setup times between the jobs. Limited discrepancy search met...