65 search results - page 4 / 13 » An Error Bound Based on a Worst Likely Assignment |
SCHEDULING
2011
13 years 1 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...
IROS
2009
IEEE
14 years 27 days ago
2009
IEEE
— The ability to detect, and track multiple moving objects like person and other robots, is an important prerequisite for mobile robots working in dynamic indoor environments. We...
JMLR
2012
11 years 8 months ago
2012
We address the problem of finding the most likely assignment or MAP estimation in a Markov random field. We analyze the linear programming formulation of MAP through the lens of...
NIPS
2004
13 years 7 months ago
2004
We develop a family of upper and lower bounds on the worst-case expected KL loss for estimating a discrete distribution on a finite number m of points, given N i.i.d. samples. Our...
RTCSA
2007
IEEE
14 years 16 days ago
2007
IEEE
This paper presents a real-time scheduling algorithm with high schedulability and few preemptions for multiprocessor systems. The algorithm is based on an unorthodox method called...