613 search results - page 14 / 123 » Finding and Fixing Faults |
FOCS
1992
IEEE
15 years 3 months ago
1992
IEEE
Consider a convex set P in IRd and a piecewise polynomial concave function F: P IR. Let A be an algorithm that given a point x IRd computes F(x) if x P, or returns a concave po...
104
click to vote
RTSS
2007
IEEE
15 years 6 months ago
2007
IEEE
This paper focuses on priority assignment for realtime systems using fixed priority scheduling. It introduces and defines the concept of a “robust” priority ordering: the most...
IUI
2009
ACM
15 years 8 months ago
2009
ACM
The results of a machine learning from user behavior can be thought of as a program, and like all programs, it may need to be debugged. Providing ways for the user to debug it mat...
ICTCS
2003
Springer
15 years 5 months ago
2003
Springer
In this paper, we study the problem of cost constrained fixed job scheduling (CCFJS). In this problem, there are a number of processors, each of which belongs to one of several cla...
102
click to vote
IJCGA
2008
14 years 11 months ago
2008
Published as Technical Report LU-CS-TR:2005-238 on February 13, 2006, ISSN 1650-1276 Report 158, Lund University, Sweden 2006 We discuss and compare four fixed parameter algorithm...