1002 search results - page 29 / 201 » Towards Graph Programs for Graph Algorithms |
139
click to vote
CEC
2005
IEEE
15 years 3 months ago
2005
IEEE
The problem of scheduling a parallel program given by a Directed Acyclic Graph (DAG) of tasks is a well-studied area. We present a new approach which employs Differential Evolution...
123
click to vote
SIGSOFT
2003
ACM
16 years 2 months ago
2003
ACM
Program slicing is a technique to identify statements that may influence the computations at other statements. Precise slicing has been shown to be undecidable for concurrent prog...
104
click to vote
TPDS
1998
15 years 1 months ago
1998
—One of the main obstacles in obtaining high performance from message-passing multicomputer systems is the inevitable communication overhead which is incurred when tasks executin...
142
click to vote
APPROX
2011
Springer
14 years 1 months ago
2011
Springer
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...
172
click to vote
CORR
2004
Springer
15 years 1 months ago
2004
Springer
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...