7311 search results - page 365 / 1463 » Time in State Machines |
202
click to vote
COCOA
2008
Springer
15 years 9 months ago
2008
Springer
We consider the problem of minimizing the total weighted completion time on identical parallel machines when jobs have stochastic processing times and may arrive over time. We give...
187
click to vote
ACMSE
1992
ACM
15 years 11 months ago
1992
ACM
The feasibility of extracting both explicit and implicit synonym references from a machine readable dictionary is investigated; the extracted synonyms, both symmetric and asymmetr...
195
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
In connection with machine arithmetic, we are interested in systems of constraints of the form x + k y + k . Over integers, the satisfiability problem for such systems is polynomi...
182
click to vote
ORL
2006
15 years 7 months ago
2006
We show that the greedy Highest Density First (HDF) algorithm is (1+ )-speed O(1)-competitive for the problem of minimizing the p norms of weighted flow time on m identical machin...
205
click to vote
VLDB
2002
ACM
15 years 7 months ago
2002
ACM
Abstract. Support vector machines (SVMs) have shown superb performance for text classification tasks. They are accurate, robust, and quick to apply to test instances. Their only po...