2370 search results - page 272 / 474 » The Characterization of Data-Accumulating Algorithms |
125
click to vote
RTSS
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract—The functional consolidation induced by the costreduction trends in embedded systems can force tasks of different criticality (e.g. ABS Brakes with DVD) to share a proce...
132
Voted
IPSN
2004
Springer
15 years 9 months ago
2004
Springer
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failu...
107
click to vote
INFOCOM
2002
IEEE
15 years 8 months ago
2002
IEEE
—In this paper, we present three algorithms that provide performance guarantees for scheduling switches, such as optical switches, with configuration overhead. Each algorithm emu...
140
click to vote
APPROX
2000
Springer
15 years 8 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 ...
139
click to vote
CIAC
2006
Springer
15 years 7 months ago
2006
Springer
The network discovery (verification) problem asks for a minimum subset Q V of queries in an undirected graph G = (V, E) such that these queries discover all edges and non-edges o...