720 search results - page 68 / 144 » Machine scheduling with resource dependent processing times |
ICASSP
2009
IEEE
15 years 6 months ago
2009
IEEE
Performance of n-gram language models depends to a large extent on the amount of training text material available for building the models and the degree to which this text matches...
157
click to vote
CORR
2010
Springer
14 years 6 months ago
2010
Springer
We consider a combinatorial generalization of the classical multi-armed bandit problem that is defined as follows. There is a given bipartite graph of M users and N M resources. F...
108
click to vote
PARLE
1993
15 years 3 months ago
1993
: Parallel database systems aim at providing high throughput for OLTP transactions as well as short response times for complex and data-intensive queries. Shared nothing systems re...
IOR
2007
14 years 11 months ago
2007
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to faciliti...
ICA3PP
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Deploying lightweight tasks on grid resources would let the communication overhead dominate the overall application processing time. Our aim is to increase the resulting ...