1002 search results - page 63 / 201 » Towards Graph Programs for Graph Algorithms |
146
click to vote
ICFEM
2000
Springer
15 years 9 months ago
2000
Springer
A family of well known problems on graphs includingthe shortest path problem and the data flow analysis problem can be uniformly formulated as a fixed-point problem on graphs. We ...
156
click to vote
ISCAS
2005
IEEE
15 years 11 months ago
2005
IEEE
— This paper introduces a heuristic solution to the multiple restricted multiplication (MRM) optimization problem. MRM refers to a situation where a single variable is multiplied...
164
click to vote
GD
2003
Springer
15 years 11 months ago
2003
Springer
A drawing of a family of cuts of a graph is an augmented drawing of the graph such that every cut in the family is represented by a simple closed curve and vice versa. We show tha...
174
click to vote
APCSAC
2003
IEEE
15 years 11 months ago
2003
IEEE
This paper introduces a method which can be used to map applications written in a high level source language program, like C, to a coarse grain reconfigurable architecture, MONTIU...
157
click to vote
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
— The problem of finding an optimal path in an uncertain graph arises in numerous applications, including network routing, path-planning for vehicles, and the control of finite...