249 search results - page 29 / 50 » Analysis of Resource Lower Bounds in Real-Time Applications |
SIGMETRICS
1997
ACM
15 years 1 months ago
1997
ACM
Informed prefetching and caching based on application disclosure of future I/O accesses (hints) can dramatically reduce the execution time of I/O-intensive applications. A recent ...
107
click to vote
INFOCOM
2003
IEEE
15 years 2 months ago
2003
IEEE
— Multiprotocol Label Switching or MPLS technology is being increasingly deployed by several of the largest Internet service providers to solve problems such as traffic engineer...
MOBIHOC
2004
ACM
15 years 9 months ago
2004
ACM
APS algorithms use the basic idea of distance vector routing to find positions in an ad hoc network using only a fraction of landmarks, for example GPS enabled nodes. All the node...
79
Voted
DATE
2004
IEEE
15 years 1 months ago
2004
IEEE
The analysis of real-time properties of an embedded system usually relies on the worst-case execution times (WCET) of the tasks to be executed. In contrast to that, in real world ...
JGO
2010
14 years 4 months ago
2010
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...