5230 search results - page 926 / 1046 » Dynamic Optimality -- Almost |
DATE
2010
IEEE
13 years 10 months ago
2010
IEEE
—Due to increase in demand for reconfigurability in embedded systems, real-time task scheduling is challenged by non-negligible reconfiguration overheads. If such overheads are n...
DSD
2010
IEEE
13 years 10 months ago
2010
IEEE
—Current general-purpose memory allocators do not provide sufficient speed or flexibility for modern highperformance applications. To optimize metrics like performance, memory us...
ICASSP
2010
IEEE
13 years 10 months ago
2010
IEEE
We consider the weight design problem for the consensus algorithm under a finite time horizon. We assume that the underlying network is random where the links fail at each iterat...
ICDAR
2007
IEEE
13 years 10 months ago
2007
IEEE
This paper is concerned with a universal pattern, which is defined as a character pattern designed to have high machine-readability. This universal pattern is a character pattern...
GLOBECOM
2008
IEEE
13 years 10 months ago
2008
IEEE
Traditional hop-by-hop dynamic routing makes inefficient use of network resources as it forwards packets along already congested shortest paths while uncongested longer paths may b...