Sciweavers

7311 search results - page 200 / 1463
» Time in State Machines
Sort
View
159
Voted
WSC
2001
15 years 8 months ago
How "overstaffing" at bottleneck machines can unleash extra capacity
Using simulation, Headway Technologies predicted that increasing staffing among a group of already lightly loaded machine operators--"overstaffing"--would significantly ...
Robert C. Kotcher
IPL
2008
80views more  IPL 2008»
15 years 7 months ago
A simpler competitive analysis for scheduling equal-length jobs on one machine with restarts
We consider the online problem of scheduling jobs with equal processing times on a single machine. Each job has a release time and a deadline, and the goal is to maximize the numb...
Michael H. Goldwasser, Arundhati Bagchi Misra
PR
2007
104views more  PR 2007»
15 years 6 months ago
Optimizing resources in model selection for support vector machine
Tuning SVM hyperparameters is an important step in achieving a high-performance learning machine. It is usually done by minimizing an estimate of generalization error based on the...
Mathias M. Adankon, Mohamed Cheriet
CORR
1999
Springer
81views Education» more  CORR 1999»
15 years 6 months ago
Explanation-based Learning for Machine Translation
In this paper we present an application of explanation-based learning (EBL) in the parsing module of a real-time English-Spanish machine translation system designed to translate c...
Janine Toole, Fred Popowich, Devlan Nicholson, Dav...
CONCUR
2009
Springer
16 years 1 months ago
Concavely-Priced Probabilistic Timed Automata
Abstract. Concavely-priced probabilistic timed automata, an extension of probabilistic timed automata, are introduced. In this paper we consider expected reachability, discounted, ...
Marcin Jurdzinski, Marta Z. Kwiatkowska, Gethin No...