A parallel approach to row-based VLSI layout using stochastic hill-climbing
Parallel algorithms based on stochastic hill-climbing and parallel algorithms based on simple elements of a genetic algorithm for the one-sided bipartite crossing number problem, used in row-based vlsi layout, were investigated. These algorithms were run on a pvm cluster. The experiments show that t...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Default Text |
| Published: |
2003
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/2134/3917 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|