GECCO
2006
Springer
14 years 4 months ago
2006
Springer
Wire routing in a VLSI chip often requires minimization of wire-length as well as the number of intersections among multiple nets. Such an optimization problem is computationally ...
101
click to vote
ICLP
2009
Springer
15 years 1 months ago
2009
Springer
We study finding similar or diverse solutions of a given computational problem, in answer set programming, and introduce offline methods and online methods to compute them using an...