255 search results - page 29 / 51 » Genetic Algorithm for Restrictive Channel Routing Problem |
109
click to vote
DAC
1989
ACM
15 years 3 months ago
1989
ACM
: We discuss a new approach to constructing the rectilinear Steiner tree (RST) of a given set of points in the plane, starting from a minimum spanning tree (MST). The main idea in ...
GLOBECOM
2006
IEEE
15 years 5 months ago
2006
IEEE
— This paper considers the problem of finding the path with minimum (zero) worst possible number of errors in a network with V nodes where (1) some nodes are capable of correcti...
GECCO
2000
Springer
15 years 3 months ago
2000
Springer
This paper presents an extension to genetic programming to allow the evolution of programs containing local variables with static scope which obey the invariant that all variables...
ICCAD
1995
IEEE
15 years 3 months ago
1995
IEEE
: We study the minimum-cost bounded-skew routing tree problem under the Elmore delay model. We presenttwo approachesto construct bounded-skew routing trees: (i) the Boundary Mergin...
101
click to vote
EC
2000
14 years 11 months ago
2000
Solving optimization problems with multiple (often conflicting) objectives is, generally, a very difficult goal. Evolutionary algorithms (EAs) were initially extended and applied ...