Sciweavers

10575 search results - page 1765 / 2115
» Programming Languages
Sort
View
CP
2007
Springer
16 years 27 days ago
Constructive Interval Disjunction
Shaving and constructive disjunction are two main refutation principles used in constraint programming. The shaving principle allows us to compute the singleton arc-consistency (SA...
Gilles Trombettoni, Gilles Chabert
ICALP
2007
Springer
16 years 27 days ago
An Optimal Decomposition Algorithm for Tree Edit Distance
Abstract. The edit distance between two ordered rooted trees with vertex labels is the minimum cost of transforming one tree into the other by a sequence of elementary operations c...
Erik D. Demaine, Shay Mozes, Benjamin Rossman, Ore...
IWMM
2007
Springer
130views Hardware» more  IWMM 2007»
16 years 26 days ago
Accordion arrays
In this work, we present accordion arrays, a straightforward and effective memory compression technique targeting Unicode-based character arrays. In many non-numeric Java programs...
Craig B. Zilles
179
Voted
OOPSLA
2007
Springer
16 years 26 days ago
Using hpm-sampling to drive dynamic compilation
All high-performance production JVMs employ an adaptive strategy for program execution. Methods are first executed unoptimized and then an online profiling mechanism is used to ...
Dries Buytaert, Andy Georges, Michael Hind, Matthe...
APLAS
2006
ACM
16 years 21 days ago
Using Metadata Transformations to Integrate Class Extensions in an Existing Class Hierarchy
Abstract. Class extensions provide a fine-grained mechanism to define incremental modifications to class-based systems when standard subclassing mechanisms are inappropriate. To...
Markus Lumpe
« Prev « First page 1765 / 2115 Last » Next »