1382 search results - page 176 / 277 » Formal Analysis of Online Algorithms |
165
click to vote
FMCAD
2006
Springer
15 years 10 months ago
2006
Springer
Synchronous Data Flow Graphs (SDFGs) have proven to be suitable for specifying and analyzing streaming applications that run on single- or multi-processor platforms. Streaming appl...
157
click to vote
CAV
2009
Springer
16 years 7 months ago
2009
Springer
This paper is concerned with the problem of computing the image of a set by a polynomial function. Such image computations constitute a crucial component in typical tools for set-b...
177
click to vote
SMC
2007
IEEE
16 years 20 days ago
2007
IEEE
: With the development of enterprise-wide and cross-enterprise application integration and interoperation towards web service, web service providers try to not only fulfill the fun...
145
click to vote
SMI
2007
IEEE
16 years 20 days ago
2007
IEEE
In this paper, we introduce localized homology, a theory for finding local geometric descriptions for topological attributes. Given a space and a cover of subspaces, we construct...
148
click to vote
TACAS
2007
Springer
16 years 15 days ago
2007
Springer
Reasoning about heap-allocated data structures such as linked lists and arrays is challenging. The reachability predicate has proved to be useful for reasoning about the heap in ty...