Sciweavers

175 search results - page 11 / 35
» A multi-period machine assignment problem
Sort
View
JDA
2008
93views more  JDA 2008»
13 years 8 months ago
On-line scheduling of parallel jobs on two machines
We study the problem of on-line scheduling of parallel jobs on two machines. The jobs are parallel in the sense that each of them specifies the number of processors, in this case ...
Wun-Tat Chan, Francis Y. L. Chin, Deshi Ye, Guochu...
APPROX
2009
Springer
163views Algorithms» more  APPROX 2009»
14 years 3 months ago
The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders
Abstract. Scheduling jobs on unrelated parallel machines so as to minimize the makespan is one of the basic, well-studied problems in the area of machine scheduling. In the first ...
José R. Correa, Martin Skutella, José...
ICML
2010
IEEE
13 years 9 months ago
Restricted Boltzmann Machines are Hard to Approximately Evaluate or Simulate
Restricted Boltzmann Machines (RBMs) are a type of probability model over the Boolean cube {-1, 1}n that have recently received much attention. We establish the intractability of ...
Philip M. Long, Rocco A. Servedio
IPL
2008
80views more  IPL 2008»
13 years 8 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
NN
2006
Springer
13 years 8 months ago
Machine learning in soil classification
In a number of engineering problems, e.g. in geotechnics, petroleum engineering, etc. intervals of measured series data (signals) are to be attributed a class maintaining the cons...
Biswanath Bhattacharya, Dimitri P. Solomatine