256 search results - page 45 / 52 » Approximation of the worst-case execution time using structu... |
143
click to vote
CIKM
2011
Springer
14 years 1 months ago
2011
Springer
A continuous top-k query retrieves the k most preferred objects in a data stream according to a given preference function. These queries are important for a broad spectrum of appl...
124
Voted
LFP
1992
15 years 2 months ago
1992
Tag handling accounts for a substantial amount of execution cost in latently typed languages such as Common LISP and Scheme, especially on architectures that provide no special ha...
137
click to vote
POPL
2011
ACM
14 years 4 months ago
2011
ACM
There have been several efforts to bring static type inference to object-oriented dynamic languages such as Ruby, Python, and Perl. In our experience, however, such type inference...
115
click to vote
CORR
2000
Springer
15 years 1 months ago
2000
Springer
-BASED ABSTRACT INTERPRETATION OF PROLOG1 BAUDOUIN LE CHARLIER, SABINA ROSSI, AND PASCAL VAN HENTENRYCK . Abstract interpretation is a general methodology for systematic developmen...
140
click to vote
ICALP
2011
Springer
14 years 5 months ago
2011
Springer
We consider the following Tree-Constrained Bipartite Matching problem: Given two rooted trees T1 = (V1, E1), T2 = (V2, E2) and a weight function w : V1 × V2 → R+, find a maximu...