1002 search results - page 152 / 201 » Towards Graph Programs for Graph Algorithms |
138
click to vote
4OR
2010
15 years 20 days ago
2010
This a summary of the author's PhD thesis supervised by Leo Liberti, Philippe Baptiste and Daniel Krob and defended on 18 June 2009 at Ecole Polytechnique, Palaiseau, France. ...
137
click to vote
CORR
2011
Springer
14 years 9 months ago
2011
Springer
We consider the problem of computing numerical invariants of programs by abstract interpretation. Our method eschews two traditional sources of imprecision: (i) the use of widenin...
124
click to vote
IWMM
2009
Springer
15 years 9 months ago
2009
Springer
Tracing algorithms visit reachable nodes in a graph and are central to activities such as garbage collection, marshalling etc. Traditional sequential algorithms use a worklist, re...
128
click to vote
ATAL
2005
Springer
15 years 7 months ago
2005
Springer
Methods for solving Distributed Constraint Optimization Problems (DCOP) have emerged as key techniques for distributed reasoning. Yet, their application faces significant hurdles...
141
click to vote
PDPTA
2000
15 years 3 months ago
2000
Exploiting compile time knowledge to improve memory bandwidth can produce noticeable improvements at run-time [13, 1]. Allocating the data structure [13] to separate memories when...