1794 search results - page 224 / 359 » Visualizing Memory Graphs |
95
Voted
ECOOP
2006
Springer
15 years 6 months ago
2006
Springer
Object-oriented programs often require large heaps to run properly or meet performance goals. They use high-overhead collections, bulky data models, and large caches. Discovering t...
132
Voted
GECCO
2008
Springer
15 years 3 months ago
2008
Springer
A new evolutionary method named “Genetic Network Programming with Control Nodes, GNPcn” has been proposed and applied to determine the timing of buying and selling stocks. GNP...
203
Voted
ICDE
1996
IEEE
16 years 3 months ago
1996
IEEE
Three pointer-based parallel join algorithms are presented and analyzed for environments in which secondary storage is made transparent to the programmer through memory mapping. B...
121
Voted
IWOMP
2007
Springer
15 years 8 months ago
2007
Springer
The paper presents a compiler framework for analyzing and optimizing OpenMP programs. The framework includes Parallel Control Flow Graph and Parallel Data Flow equations based on t...
120
click to vote
ISSS
2000
IEEE
15 years 7 months ago
2000
IEEE
Even though high-level hardware synthesis from dataflow graphs becomes popular in designing DSP systems, currently used dataflow models are inefficient to deal with emerging multi...