117 search results - page 11 / 24 » Run-Time Bytecode Specialization |
SC
2005
ACM
14 years 3 months ago
2005
ACM
We present a new methodology for generating and adapting octree meshes for terascale applications. Our approach combines existing methods, such as parallel octree decomposition and...
ASIACRYPT
2003
Springer
14 years 2 months ago
2003
Springer
The Weil and Tate pairings have been used recently to build new schemes in cryptography. It is known that the Weil pairing takes longer than twice the running time of the Tate pair...
ASPDAC
1995
ACM
14 years 1 months ago
1995
ACM
In this article a scheduling method is presented which is capable of allocating supplementary resources during scheduling. This makes it very suitable in synthesis strategies base...
ANSS
1991
IEEE
14 years 1 months ago
1991
IEEE
This paper first summerizes and then presents a formal proof to a new conservative deadlock-free algorithm, YADDES [l], for asynchronous discrete event simulation. The proof not o...
DAGSTUHL
2007
13 years 11 months ago
2007
One of the standard basic steps in drawing hierarchical graphs is to invert some arcs of the given graph to make the graph acyclic. We discuss exact and parameterized algorithms fo...