1002 search results - page 114 / 201 » Towards Graph Programs for Graph Algorithms |
135
Voted
PPOPP
2012
ACM
13 years 10 months ago
2012
ACM
Analysis of massive graphs has emerged as an important area for massively parallel computation. In this paper, it is shown how the Fresh Breeze trees-of-chunks memory model may be...
124
click to vote
ATAL
2007
Springer
15 years 6 months ago
2007
Springer
From a multiagent viewpoint, a workflow is a dynamic set of tasks performed by a set of agents to reach a shared goal. We show herein that commitments among agents can be used to ...
115
Voted
ESA
2004
Springer
15 years 8 months ago
2004
Springer
The computation of dominators in a flowgraph has applications in several areas, including program optimization, circuit testing, and theoretical biology. Lengauer and Tarjan [30]...
103
Voted
ICALP
2007
Springer
15 years 8 months ago
2007
Springer
Register allocation is NP-complete in general but can be solved in linear time for straight-line programs where each variable has at most one definition point if the bank of regis...
162
Voted
CORR
2011
Springer
14 years 6 months ago
2011
Springer
We propose a logical/mathematical framework for statistical parameter learning of parameterized logic programs, i.e. de nite clause programs containing probabilistic facts with a ...