766 search results - page 39 / 154 » Online Variance Minimization |
AIPS
2009
15 years 29 days ago
2009
We propose an online algorithm for planning under uncertainty in multi-agent settings modeled as DEC-POMDPs. The algorithm helps overcome the high computational complexity of solv...
104
click to vote
JDA
2008
14 years 11 months ago
2008
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 ...
IPPS
2008
IEEE
15 years 6 months ago
2008
IEEE
This paper addresses nonclairvoyant and nonpreemptive online job scheduling in Grids. In the applied basic model, the Grid system consists of a large number of identical processor...
ICIP
2007
IEEE
15 years 6 months ago
2007
IEEE
Online target tracking requires to solve two problems: data association and online dynamic estimation. Usually, association effectiveness is based on prior information and observa...
104
click to vote
WAOA
2004
Springer
15 years 5 months ago
2004
Springer
We consider a non-preemptive, stochastic parallel machine scheduling model with the goal to minimize the weighted completion times of jobs. In contrast to the classical stochastic ...