3885 search results - page 521 / 777 » Transformations for Write-All-with-Collision Model |
177
click to vote
LCTRTS
2009
Springer
16 years 1 months ago
2009
Springer
Most programming languages support a call stack in the programming model and also in the runtime system. We show that for applications targeting low-power embedded microcontroller...
160
click to vote
CIVR
2007
Springer
16 years 24 days ago
2007
Springer
We present a novel matching and similarity evaluation method for planar geometric shapes represented by sets of polygonal curves. Given two shapes, the matching algorithm randomly...
200
click to vote
PPDP
2007
Springer
16 years 22 days ago
2007
Springer
We give a novel transformation for proving termination of higher-order rewrite systems in the format of Inductive Data Type Systems (IDTSs) by Blanqui, Jouannaud and Okada. The tr...
180
click to vote
CGO
2006
IEEE
16 years 21 days ago
2006
IEEE
Software code caches help amortize the overhead of dynamic binary transformation by enabling reuse of transformed code. Since code caches contain a potentiallyaltered copy of ever...
181
click to vote
JELIA
2004
Springer
15 years 12 months ago
2004
Springer
We briefly overview the most recent improvements we have incorporated to the existent implementations of the TAS methodology, the simplified ∆-tree representation of formulas i...