3934 search results - page 332 / 787 » Approximate Schedulability Analysis |
175
click to vote
GLOBECOM
2009
IEEE
16 years 1 months ago
2009
IEEE
—With recent advances in optical technology, we are closer to building all-optical routers than ever before. A major problem in this area, however, is the lack of all-optical mem...
166
click to vote
ICALP
2003
Springer
15 years 12 months ago
2003
Springer
We study algorithmic problems that are motivated by bandwidth trading in next generation networks. Typically, bandwidth trading involves sellers (e.g., network operators) interest...
184
click to vote
IM
2007
15 years 8 months ago
2007
— We consider whether the off-line compilation of a set of Service Level Agreements (SLAs) into low-level management policies can lead to the runtime maximization of the overall ...
175
click to vote
ESA
2009
Springer
16 years 1 months ago
2009
Springer
Dial-a-Ride problems consist of a set V of n vertices in a metric space (denoting travel time between vertices) and a set of m objects represented as source-destination pairs {(si,...
202
click to vote
DAC
2000
ACM
16 years 7 months ago
2000
ACM
In this paper, we present a case study for the design, programming and usage of a reconfigurable system-on-chip, MorphoSys, which is targeted at computation-intensive applications...