2218 search results - page 119 / 444 » Testing Expressibility Is Hard |
SODA
2010
ACM
14 years 6 months ago
2010
ACM
We investigate the preemptive scheduling of periodic tasks with hard deadlines. We show that, even in the uniprocessor case, no polynomial time algorithm can test the feasibility ...
NIPS
2003
13 years 10 months ago
2003
When clustering a dataset, the right number k of clusters to use is often not obvious, and choosing k automatically is a hard algorithmic problem. In this paper we present an impr...
IEEEARES
2007
IEEE
14 years 3 months ago
2007
IEEE
It is difficult to apply existing software development methods to security concerns. Using software for security testing purposes, in particular, is hard to do. The fact that ther...
RTSS
2007
IEEE
14 years 3 months ago
2007
IEEE
This paper focuses on scheduling different hard real-time applications on a uniprocessor when the earliest deadline first algorithm is used as the local scheduler, and the global ...
ISQED
2005
IEEE
14 years 2 months ago
2005
IEEE
In this paper, design and measurement results of a test chip that intends to evaluate differences between layout techniques for rectangular unit-capacitor arrays are introduced. P...