1095 search results - page 76 / 219 » Efficient Algorithms for Average Completion Time Scheduling |
148
click to vote
ICIP
2006
IEEE
16 years 8 months ago
2006
IEEE
A real-time adaptive non-parametric thresholding algorithm for change detection is proposed in this paper. Based on the estimation of the scatter of regions of change in a differe...
172
click to vote
IANDC
2007
15 years 6 months ago
2007
We present a model, task automata, for real time systems with non-uniformly recurring computation tasks. It is an extended version of timed automata with asynchronous processes th...
200
click to vote
PDP
2010
IEEE
15 years 10 months ago
2010
IEEE
Scheduling large amounts of tasks in distributed computing platforms composed of millions of nodes is a challenging goal, even more in a fully decentralized way and with low overhe...
175
click to vote
AAAI
2008
15 years 8 months ago
2008
In a class of games known as Stackelberg games, one agent (the leader) must commit to a strategy that can be observed by the other agent (the adversary/follower) before the advers...
172
click to vote
SPAA
2005
ACM
15 years 11 months ago
2005
ACM
We describe a new class of utility-maximization scheduling problem with precedence constraints, the disconnected staged scheduling problem (DSSP). DSSP is a nonpreemptive multipro...