1024 search results - page 74 / 205 » Value complete, column complete, predicate complete |
164
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...
132
click to vote
ESOP
2001
Springer
15 years 10 months ago
2001
Springer
Constant propagation (CP) is one of the most widely used optimizations in practice (cf. [9]). Intuitively, it addresses the problem of statically detecting whether an expression al...
161
click to vote
APPROX
2000
Springer
15 years 9 months ago
2000
Springer
In this paper, we derive bounds on performance guarantees of online algorithms for real-time preemptive scheduling of jobs with deadlines on K machines when jobs are characterized ...
152
Voted
AIPS
2010
15 years 7 months ago
2010
Computing a good policy in stochastic uncertain environments with unknown dynamics and reward model parameters is a challenging task. In a number of domains, ranging from space ro...
152
click to vote
CATS
2006
15 years 6 months ago
2006
The busy beaver is an example of a function which is not computable. It is based on a particular class of Turing machines, and is defined as the largest number of 1's that ca...