777 search results - page 131 / 156 » A fast algorithm for the computation of an upper bound on th... |
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 ...
SIGECOM
2009
ACM
14 years 3 months ago
2009
ACM
The literature on algorithmic mechanism design is mostly concerned with game-theoretic versions of optimization problems to which standard economic money-based mechanisms cannot b...
ICPADS
2005
IEEE
14 years 2 months ago
2005
IEEE
- This paper proposes a new distributed QoS routing protocol, called Efficient Distributed QoS Routing (EDQR), for MPLS networks. The path searching algorithm of EDQR considers an ...
SIAMJO
2002
13 years 8 months ago
2002
In this paper we propose a novel finite-horizon, discrete-time, time-varying filtering method based on the robust semidefinite programming (SDP) technique. The proposed method prov...
VISSYM
2003
13 years 10 months ago
2003
We present a fast method that adaptively approximates large-scale functional scattered data sets with hierarchical B-splines. The scheme is memory efficient, easy to implement an...