Sciweavers

4903 search results - page 125 / 981
» The Set Covering Machine
Sort
View
110
Voted
CSDA
2007
105views more  CSDA 2007»
15 years 2 months ago
Model selection for support vector machines via uniform design
The problem of choosing a good parameter setting for a better generalization performance in a learning task is the so-called model selection. A nested uniform design (UD) methodol...
Chien-Ming Huang, Yuh-Jye Lee, Dennis K. J. Lin, S...
110
Voted
RANDOM
1999
Springer
15 years 6 months ago
Scheduling with Unexpected Machine Breakdowns
We investigate an online version of a basic scheduling problem where a set of jobs has to be scheduled on a number of identical machines so as to minimize the makespan. The job pr...
Susanne Albers, Günter Schmidt
116
Voted
EUROPAR
2008
Springer
15 years 4 months ago
Bi-objective Approximation Scheme for Makespan and Reliability Optimization on Uniform Parallel Machines
We study the problem of scheduling independent tasks on a set of related processors which have a probability of failure governed by an exponential law. We are interested in the bi-...
Emmanuel Jeannot, Erik Saule, Denis Trystram
95
Voted
EMNLP
2006
15 years 4 months ago
Phrasetable Smoothing for Statistical Machine Translation
We discuss different strategies for smoothing the phrasetable in Statistical MT, and give results over a range of translation settings. We show that any type of smoothing is a bet...
George F. Foster, Roland Kuhn, Howard Johnson
117
Voted
SIGACT
2010
76views more  SIGACT 2010»
14 years 9 months ago
Reconfiguring a state machine
Reconfiguration means changing the set of processes executing a distributed system. We explain several methods for reconfiguring a system implemented using the state-machine appro...
Leslie Lamport, Dahlia Malkhi, Lidong Zhou