1002 search results - page 104 / 201 » Towards Graph Programs for Graph Algorithms |
156
click to vote
PVM
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Designing and tuning parallel applications with MPI, particularly at large scale, requires understanding the performance implications of different choices of algorithms ...
108
click to vote
CPAIOR
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. AND/OR search spaces are a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sensitivity to the struc...
108
click to vote
ICFP
2001
ACM
16 years 2 months ago
2001
ACM
Contification is a compiler optimization that turns a function that always returns to the same place into a continuation. Compilers for functional languages use contification to e...
121
click to vote
PODC
2005
ACM
15 years 8 months ago
2005
ACM
In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a trade-off between the amount of...
94
Voted
ICSE
2003
IEEE-ACM
16 years 2 months ago
2003
IEEE-ACM
Dynamic slicing algorithms can greatly reduce the debugging effort by focusing the attention of the user on a relevant subset of program statements. In this paper we present the d...