3320 search results - page 322 / 664 » Heuristics for the Phylogeny Problem |
173
click to vote
DAC
1989
ACM
15 years 11 months ago
1989
ACM
We present a new 0 (n2) heuristic for hypergraph min-cut bipartitioning, an important problem in circuit placement. Fastest previous methods for this problem are O(n2 log n). Our ...
177
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
Network topology design problems find application in several real life scenarios. However, most designs in the past either optimize for a single criterion like delay or assume sim...
158
click to vote
ICC
2007
IEEE
15 years 10 months ago
2007
IEEE
The construction of good, finite-length, LDPC codes is currently an attractive research area. Reducing attention to the Binary Erasure Channel (BEC), this problem translates into t...
179
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
The No-Free-Lunch theorems (NFLTs) are criticized for being too general to be of any relevance to the real world scenario. This paper investigates, both formally and empirically, ...
157
click to vote
DAC
1995
ACM
15 years 10 months ago
1995
ACM
—We address the problem of code optimization for embedded DSP microprocessors. Such processors (e.g., those in the TMS320 series) have highly irregular datapaths, and conventiona...