610 search results - page 116 / 122 » Solving Geometrical Place Problems by using Evolutionary Alg... |
100
click to vote
CCO
2001
Springer
15 years 4 months ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
104
click to vote
GECCO
2007
Springer
15 years 5 months ago
2007
Springer
The application of resource-defined fitness sharing (RFS) to shape nesting problems reveals a remarkable ability to discover tilings [7, 8]. These tilings represent exact covers...
108
click to vote
JCB
2007
14 years 11 months ago
2007
The assignment of orthologous genes between a pair of genomes is a fundamental and challenging problem in comparative genomics, since many computational methods for solving variou...
103
click to vote
CORR
2011
Springer
14 years 3 months ago
2011
Springer
Wireless systems comprised of rechargeable nodes have a significantly prolonged lifetime and are sustainable. A distinct characteristic of these systems is the fact that the node...
105
click to vote
SMA
2008
ACM
14 years 11 months ago
2008
ACM
We present robust and efficient algorithms for computing Voronoi diagrams of planar freeform curves. Boundaries of the Voronoi diagram consist of portions of the bisector curves b...