1002 search results - page 47 / 201 » Towards Graph Programs for Graph Algorithms |
CP
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. We present an incomplete filtering algorithm for the circuit constraint. The filter removes redundant values by eliminating nonHamiltonian edges from the associated gra...
113
click to vote
IWOCA
2009
Springer
15 years 8 months ago
2009
Springer
The Feedback Vertex Set problem asks whether a graph contains q vertices meeting all its cycles. This is not a local property, in the sense that we cannot check if q vertices meet...
138
click to vote
LCPC
1994
Springer
15 years 6 months ago
1994
Springer
Data parallel programs are sensitive to the distribution of data across processor nodes. We formulate the reduction of inter-node communication as an optimization on a colored gra...
138
click to vote
GECCO
2010
Springer
15 years 6 months ago
2010
Springer
This paper presents a new form of Genetic Programming called Cartesian Genetic Programming in which a program is represented as an indexed graph. The graph is encoded in the form o...
124
click to vote
GECCO
2008
Springer
15 years 3 months ago
2008
Springer
A new evolutionary method named “Genetic Network Programming with Control Nodes, GNPcn” has been proposed and applied to determine the timing of buying and selling stocks. GNP...