2244 search results - page 68 / 449 » A new heuristic approach for non-convex optimization problem... |
158
click to vote
JCO
2002
15 years 5 months ago
2002
The single machine scheduling problem with sum of completion times criterion (SS) can be solved easily by the Shortest Processing Time (SPT) rule. In the case of significant uncert...
150
click to vote
GECCO
2003
Springer
15 years 11 months ago
2003
Springer
In this paper, we propose an integrated Genetic Algorithm with Hill Climbing to solve the matrix bandwidth minimization problem, which is to reduce bandwidth by permuting rows and ...
149
click to vote
SAC
2004
ACM
15 years 11 months ago
2004
ACM
It is increasingly important to optimally select base stations in the design of cellular networks, as customers demand cheaper and better wireless services. From a set of potentia...
152
click to vote
ANOR
2005
15 years 6 months ago
2005
: The vertex coloring problem has been the subject of extensive research for many years. Driven by application potential as well as computational challenge, a variety of methods ha...
170
click to vote
BIBE
2007
IEEE
16 years 15 days ago
2007
IEEE
Abstract—Because of the advent of high-throughput sequencing and the consequent reduction in cost of sequencing, many organisms have been completely sequenced and most of their g...