29908 search results - page 408 / 5982 » On the Complexity of |
182
click to vote
SODA
2010
ACM
16 years 4 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 ...
163
click to vote
ALT
2009
Springer
16 years 3 months ago
2009
Springer
Abstract. The paper considers the problem of semi-supervised multiview classification, where each view corresponds to a Reproducing Kernel Hilbert Space. An algorithm based on co-...
173
click to vote
ICCD
2006
IEEE
16 years 3 months ago
2006
IEEE
This paper presents a new scheduling technique to improve the speed, power, and scalability of a dynamic scheduler. In a high-performance superscalar processor, the instruction sc...
143
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
We call a CNF formula linear if any two clauses have at most one variable in common. We show that there exist unsatisfiable linear k-CNF formulas with at most 4k2 4k clauses, and ...
207
click to vote
LATIN
2010
Springer
16 years 1 months ago
2010
Springer
Topological self-stabilization is an important concept to build robust open distributed systems (such as peer-to-peer systems) where nodes can organize themselves into meaningful n...