1002 search results - page 99 / 201 » Towards Graph Programs for Graph Algorithms |
MA
1999
Springer
15 years 6 months ago
1999
Springer
There is considerable interest in developing runtime infrastructures for programs that can migrate from one host to another. Mobile programs are appealing because they support efï...
118
click to vote
PPAM
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. The paper presents an algorithm for scheduling parallel programs for execution in a parallel architecture based on dynamic SMP processor clusters with data transfers on t...
124
Voted
ICALP
1997
Springer
15 years 6 months ago
1997
Springer
In this paper we develop a new elementary algorithm for model-checking infinite sequential processes, including context-free processes, pushdown processes, and regular graphs, tha...
147
Voted
APPROX
2005
Springer
15 years 8 months ago
2005
Springer
We study the partial vertex cover problem. Given a graph G = (V, E), a weight function w : V → R+ , and an integer s, our goal is to cover all but s edges, by picking a set of v...
120
click to vote
PPOPP
2010
ACM
15 years 12 months ago
2010
ACM
Irregular algorithms are organized around pointer-based data structures such as graphs and trees, and they are ubiquitous in applications. Recent work by the Galois project has pr...