Sciweavers

1485 search results - page 169 / 297
» Whole Program Paths
Sort
View
CASES
2006
ACM
14 years 3 months ago
A dynamic code placement technique for scratchpad memory using postpass optimization
In this paper, we propose a fully automatic dynamic scratchpad memory (SPM) management technique for instructions. Our technique loads required code segments into the SPM on deman...
Bernhard Egger, Chihun Kim, Choonki Jang, Yoonsung...
GG
2004
Springer
14 years 2 months ago
Extending Graph Rewriting for Refactoring
Refactorings are transformations that change the structure of a program, while preserving the behavior. The topic has attracted a lot of attention recently, since it is a promising...
Niels Van Eetvelde, Dirk Janssens
WABI
2004
Springer
116views Bioinformatics» more  WABI 2004»
14 years 2 months ago
Topological Rearrangements and Local Search Method for Tandem Duplication Trees
—The problem of reconstructing the duplication history of a set of tandemly repeated sequences was first introduced by Fitch [4]. Many recent studies deal with this problem, show...
Denis Bertrand, Olivier Gascuel
ICALP
2010
Springer
14 years 1 months ago
New Data Structures for Subgraph Connectivity
Abstract. We study the “subgraph connectivity” problem for undirected graphs with sublinear vertex update time. In this problem, we can make vertices active or inactive in a gr...
Ran Duan
ICS
1999
Tsinghua U.
14 years 1 months ago
Clustered speculative multithreaded processors
In this paper we present a processor microarchitecture that can simultaneously execute multiple threads and has a clustered design for scalability purposes. A main feature of the ...
Pedro Marcuello, Antonio González