2398 search results - page 83 / 480 » Constraint Programming and Graph Algorithms |
125
click to vote
CP
2007
Springer
15 years 11 months ago
2007
Springer
We introduce a definition of constraint symmetry for soft CSPs, based on the definition of constraint symmetry for classical CSPs. We show that the constraint symmetry group of a...
152
click to vote
PLDI
1993
ACM
15 years 9 months ago
1993
ACM
Program analysis and optimizationcan be speeded upthrough the use of the dependence flow graph (DFG), a representation of program dependences which generalizes def-use chains and...
136
click to vote
DAC
2007
ACM
16 years 5 months ago
2007
ACM
The flip-chip package provides a high chip-density solution to the demand for more I/O pads of VLSI designs. In this paper, we present the first routing algorithm in the literatur...
138
click to vote
GECCO
2004
Springer
15 years 10 months ago
2004
Springer
A new graph-based evolutionary algorithm named “Genetic Network Programming, GNP” has been proposed. GNP represents its solutions as directed graph structures, which can improv...
156
click to vote
CADE
2003
Springer
16 years 5 months ago
2003
Springer
This paper develops sound modelling and reasoning methods for imperative programs with pointers: heaps are modelled as mappings from addresses to values, and pointer structures are...