1794 search results - page 74 / 359 » Visualizing Memory Graphs |
145
click to vote
CJ
1999
15 years 3 months ago
1999
We present a compiler optimization approach that uses the simulated evolution (SE) paradigm to enhance the finish time of heuristically scheduled computations with communication t...
168
click to vote
PARA
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. This paper presents new efficient parallel algorithms for finding approximate solutions to graph coloring problems. We consider an existing shared memory parallel graph...
139
click to vote
SIGECOM
2010
ACM
15 years 2 months ago
2010
ACM
We derive efficient algorithms for both detecting and representing matchings in lopsided bipartite graphs; such graphs have so many nodes on one side that it is infeasible to repr...
128
click to vote
ASWEC
2004
IEEE
15 years 7 months ago
2004
IEEE
Object-oriented programs, when executed, produce a complex webs of objects and references between them, generally referred to as object graphs. These object graphs are difficult t...
126
Voted
AAAI
2007
15 years 6 months ago
2007
We describe a novel approach to parallelizing graph search using structured duplicate detection. Structured duplicate detection was originally developed as an approach to external...