2398 search results - page 113 / 480 » Constraint Programming and Graph Algorithms |
171
click to vote
DAGSTUHL
1996
15 years 6 months ago
1996
An analysis method for specialization of imperative programs is described in this paper. This analysis is an inter-procedural data flow method operating on control flow graphs and...
129
click to vote
SAS
2004
Springer
15 years 10 months ago
2004
Springer
We describe a polynomial-time algorithm for global value numbering, which is the problem of discovering equivalences among program sub-expressions. We treat all conditionals as non...
155
click to vote
GECCO
2008
Springer
15 years 6 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...
156
click to vote
ICSE
1999
IEEE-ACM
15 years 9 months ago
1999
IEEE-ACM
In this paper we show how the FLAVERS data flow analysis technique, originally formulated for programs with the rendezvous model of concurrency, can be applied to concurrent Java...
139
click to vote
CP
2008
Springer
15 years 6 months ago
2008
Springer
We propose new filtering algorithms for the SEQUENCE constraint and some extensions of the SEQUENCE constraint based on network flows. We enforce domain consistency on the SEQUENCE...