2335 search results - page 278 / 467 » Functional Differentiation of Computer Programs |
126
Voted
FOCS
1992
IEEE
15 years 6 months ago
1992
IEEE
We describe dynamic data structures for half-space range reporting and for maintaining the minima of a decomposable function. Using these data structures, we obtain efficient dyna...
113
click to vote
ERSHOV
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. The Java Supercompiler (JScp) is a specializer of Java programs based on the Turchin's supercompilation method and extended to support imperative and object-oriented...
113
click to vote
EOR
2010
15 years 2 months ago
2010
In the Attractive Traveling Salesman Problem the vertex set is partitioned into facility vertices and customer vertices. A maximum profit tour must be constructed on a subset of t...
120
click to vote
TCS
2008
15 years 2 months ago
2008
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
134
click to vote
ICSOC
2009
Springer
15 years 5 days ago
2009
Springer
Several activities in service oriented computing can benefit from knowing ahead of time future properties of a given service composition. In this paper we focus on how statically i...