8824 search results - page 34 / 1765 » On the Complexity of Real Functions |
WADS
2001
Springer
14 years 28 days ago
2001
Springer
Abstract. Many real-time embedded systems involve a collection of independently executing event-driven code blocks, having hard real-time constraints. Portions of such codes when t...
SODA
2010
ACM
14 years 5 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 ...
ALENEX
2010
13 years 10 months ago
2010
Small-world experiments in which packages reach addressees unknown to the original sender through a forwarding chain confirm that acquaintance networks have short paths, a propert...
TCS
2002
13 years 8 months ago
2002
We discuss several complexity measures for Boolean functions: certi cate complexity, sensitivity, block sensitivity, and the degree of a representing or approximating polynomial. ...
ICC
2007
IEEE
14 years 2 months ago
2007
IEEE
—In this paper, we present an original image quality metric for open-loop transcoding architectures based on frequency selective transmission. The proposed metric computes the no...