Sciweavers

200 search results - page 29 / 40
» Approximation Algorithms for Scheduling on Multiple Machines
Sort
View
154
Voted
PPSC
2001
15 years 4 months ago
Airline Crew Pairing Generation in Parallel
Crew pairing generation is a time consuming part of the complex process of airline crew scheduling. We present a parallel algorithm for this problem's solution and several im...
Diego Klabjan, Karsten Schwan
108
Voted
SCHEDULING
2008
89views more  SCHEDULING 2008»
15 years 2 months ago
Batch scheduling of step deteriorating jobs
In this paper we consider the problem of scheduling n jobs on a single machine, where the jobs are processed in batches and the processing time of each job is a step function depe...
M. S. Barketau, T. C. Edwin Cheng, C. T. Ng, Vladi...
ICML
2005
IEEE
16 years 3 months ago
Coarticulation: an approach for generating concurrent plans in Markov decision processes
We study an approach for performing concurrent activities in Markov decision processes (MDPs) based on the coarticulation framework. We assume that the agent has multiple degrees ...
Khashayar Rohanimanesh, Sridhar Mahadevan
116
Voted
IPPS
1996
IEEE
15 years 7 months ago
Dag-Consistent Distributed Shared Memory
We introduce dag consistency, a relaxed consistency model for distributed shared memory which is suitable for multithreaded programming. We have implemented dag consistency in sof...
Robert D. Blumofe, Matteo Frigo, Christopher F. Jo...
147
Voted
ICML
2008
IEEE
16 years 3 months ago
Modeling interleaved hidden processes
Hidden Markov models assume that observations in time series data stem from some hidden process that can be compactly represented as a Markov chain. We generalize this model by as...
Niels Landwehr