536 search results - page 90 / 108 » The hardness and approximation algorithms for l-diversity |
WIOPT
2005
IEEE
14 years 1 months ago
2005
IEEE
We consider the problem of transmission scheduling of data over a wireless fading channel with hard deadline constraints. Our system consists of N users, each with a fixed amount...
ICCAD
2003
IEEE
14 years 5 months ago
2003
IEEE
– Many embedded system designs usually impose (hard) read-time constraints on tasks. Thus, computing a tight upper bound of the worst case execution time (WCET) of a software is ...
ICMCS
2007
IEEE
14 years 2 months ago
2007
IEEE
Limited bandwidth and high packet loss pose a serious challenge for video streaming over wireless networks. Even when packet loss in the medium is not present, the fluctuating ava...
QEST
2007
IEEE
14 years 2 months ago
2007
IEEE
Among the many stages of a simulation study, debugging a simulation model is the one that is hardly reported on but that may consume a considerable amount of time and effort. In t...
LATIN
2010
Springer
14 years 1 months ago
2010
Springer
In this paper, we consider Steiner forest and its generalizations, prize-collecting Steiner forest and k-Steiner forest, when the vertices of the input graph are points in the Euc...