2252 search results - page 246 / 451 » Lower Bounds for Dynamic Algorithms |
118
click to vote
WCET
2010
15 years 1 months ago
2010
Current worst-case execution time (WCET) analyses do not support programs using dynamic memory allocation. This is mainly due to the unpredictability of cache performance introduc...
142
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Abstract—This paper studies the problem of distributed computation over a network of wireless sensors. While this problem applies to many emerging applications, to keep our discu...
198
click to vote
WAOA
2010
Springer
15 years 1 months ago
2010
Springer
We study flows over time in networks with transit times on the arcs. Transit times describe how long it takes to traverse an arc. A flow over time specifies for each arc a time-dep...
140
Voted
AI
2008
Springer
15 years 3 months ago
2008
Springer
The notion of maintenance often appears in the AI literature in the context of agent behavior and planning. In this paper, we argue that earlier characterizations of the notion of...
124
click to vote
STOC
2004
ACM
16 years 4 months ago
2004
ACM
We investigate the design of algorithms resilient to memory faults, i.e., algorithms that, despite the corruption of some memory values during their execution, are able to produce...