523 search results - page 13 / 105 » On the Signal Bounding Problem in Timing Analysis |
114
click to vote
ICASSP
2010
IEEE
14 years 12 months ago
2010
IEEE
In Cognitive Radio scenarios channelization information from primary network may be available to the spectral monitor. Under this assumption we propose a spectral estimation algor...
STOC
2003
ACM
15 years 12 months ago
2003
ACM
In this paper, we present the first average-case analysis proving an expected polynomial running time for an exact algorithm for the 0/1 knapsack problem. In particular, we prove,...
109
click to vote
ESA
2009
Springer
15 years 6 months ago
2009
Springer
We introduce the First Fit Matching Periods algorithm for rate-monotonic multiprocessor scheduling of periodic tasks with implicit deadlines and show that it yields asymptotically...
VLSID
1994
IEEE
15 years 3 months ago
1994
IEEE
In this paper, we present a formal analysis of the constraints of the scheduling problem, and evaluate the structure of the scheduling polytope described by those constraints. Pol...
CORR
2008
Springer
14 years 11 months ago
2008
Springer
One of the most fundamental problems in large-scale network analysis is to determine the importance of a particular node in a network. Betweenness centrality is the most widely us...