1382 search results - page 84 / 277 » Formal Analysis of Online Algorithms |
159
Voted
WWW
2004
ACM
16 years 6 months ago
2004
ACM
The rapid growth of the web has been noted and tracked extensively. Recent studies have however documented the dual phenomenon: web pages have small half lives, and thus the web e...
184
click to vote
SAS
2010
Springer
15 years 4 months ago
2010
Springer
The efficiency of a points-to analysis is critical for several compiler optimizations and transformations, and has attracted considerable research attention. Despite several advanc...
157
click to vote
FSTTCS
2007
Springer
16 years 4 days ago
2007
Springer
Abstract. Pushdown systems (PDSs) are an automata-theoretic formalism for specifying a class of infinite-state transition systems. Infiniteness comes from the fact that each con...
158
click to vote
SAS
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. In this paper we present a scalable pointer analysis for embedded applications that is able to distinguish between instances of recursively defined data structures and e...
150
click to vote
SWAT
2004
Springer
15 years 11 months ago
2004
Springer
The seat reservation problem is the problem of assigning passengers to seats on a train with n seats and k stations enroute in an online manner. The performance of algorithms for t...