1002 search results - page 91 / 201 » Towards Graph Programs for Graph Algorithms |
113
Voted
ICLP
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. Region-based memory management is a form of compiletime memory management, well-known from the functional programming world. This paper describes a static region analysis...
116
Voted
CIKM
2005
Springer
15 years 8 months ago
2005
Springer
Testing reachability between nodes in a graph is a well-known problem with many important applications, including knowledge representation, program analysis, and more recently, bi...
123
click to vote
ICALP
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We give an fpt approximation algorithm for the directed vertex disjoint cycle problem. Given a directed graph G with n vertices and a positive integer k, the algorithm co...
151
Voted
ASPLOS
2008
ACM
15 years 4 months ago
2008
ACM
The recent shift in the industry towards chip multiprocessor (CMP) designs has brought the need for multi-threaded applications to mainstream computing. As observed in several lim...
119
click to vote
CORR
2008
Springer
15 years 2 months ago
2008
Springer
In the constraint programming framework, state-of-the-art static and dynamic decomposition techniques are hard to apply to problems with complete initial constraint graphs. For suc...