1182 search results - page 154 / 237 » Iterative Methods in Combinatorial Optimization |
98
Voted
ISPD
1997
ACM
15 years 6 months ago
1997
ACM
A linear wirelength objective more e ectively captures timing, congestion, and other global placement considerations than a squared wirelength objective. The GORDIAN-L cell placem...
214
Voted
UPP
2004
Springer
15 years 8 months ago
2004
Springer
Evolving solutions rather than computing them certainly represents an unconventional programming approach. The general methodology of evolutionary computation has already been know...
119
Voted
WABI
2007
Springer
15 years 8 months ago
2007
Springer
The within-species genetic variation due to recombinations leads to a mosaic-like structure of DNA. This structure can be modeled, e.g. by parsing sample sequences of current DNA w...
128
Voted
GECCO
2005
Springer
15 years 8 months ago
2005
Springer
Genetic Algorithms (GAs) can efficiently produce high quality results for hard combinatorial real world problems such as the Vehicle Routing Problem (VRP). Genetic Vehicle Represe...
123
click to vote
SODA
2008
ACM
15 years 4 months ago
2008
ACM
We prove that binary linear concatenated codes with an outer algebraic code (specifically, a folded Reed-Solomon code) and independently and randomly chosen linear inner codes ach...