73 search results - page 3 / 15 » Faster Evolutionary Algorithms by Superior Graph Representat... |
100
Voted
EVOW
2004
Springer
15 years 9 months ago
2004
Springer
Recently, an approach has been presented to minimize Disjoint Sumof-Products (DSOPs) based on Binary Decision Diagrams (BDDs). Due to the symbolic representation of cubes for larg...
136
Voted
GECCO
2006
Springer
15 years 7 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 ...
126
Voted
ICNP
2007
IEEE
15 years 10 months ago
2007
IEEE
—Data structures representing directed graphs with edges labeled by symbols from a finite alphabet are used to implement packet processing algorithms used in a variety of network...
126
Voted
EVOW
2004
Springer
15 years 9 months ago
2004
Springer
This paper describes a novel representation and ordering model that, aided by an evolutionary algorithm, is used in solving the graph k-colouring problem. Its strength lies in redu...
152
Voted
DSD
2003
IEEE
15 years 9 months ago
2003
IEEE
Heuristic algorithms for coloring the edges of large undirected single-edge graphs with (or very close to) the minimal number of colors are presented. Compared to simulated anneal...