569 search results - page 18 / 114 » Online Bounds for Bayesian Algorithms |
ICALP
2004
Springer
15 years 3 months ago
2004
Springer
We consider the following scheduling problem. The input is a set of jobs with equal processing times, where each job is specified by its release time and deadline. The goal is to ...
ORDER
2007
14 years 9 months ago
2007
On-line chain partitioning problem of on-line posets has been open for the past 20 years. The best known on-line algorithm uses 5w −1 4 chains to cover poset of width w. Felsner ...
153
click to vote
SCHEDULING
2011
14 years 4 months ago
2011
While standard parallel machine scheduling is concerned with good assignments of jobs to machines, we aim to understand how the quality of an assignment is affected if the jobs...
ESA
2004
Springer
15 years 1 months ago
2004
Springer
The main contribution of this paper is an optimal bounded space online algorithm for variable-sized multidimensional packing. In this problem, hyperboxes must be packed in ddimens...
CDC
2009
IEEE
15 years 2 months ago
2009
IEEE
— Dynamic Bayesian Networks (DBNs) provide a systematic framework for robust online monitoring of dynamic systems. This paper presents an approach for increasing the efficiency ...