1628 search results - page 93 / 326 » Partitioning Sets with Genetic Algorithms |
CORR
2007
Springer
14 years 11 months ago
2007
Springer
The Steiner tree problem is a classical NP-hard optimization problem with a wide range of practical applications. In an instance of this problem, we are given an undirected graph ...
ISCI
2002
14 years 11 months ago
2002
Video information processing has been one of great challenging areas in the database community since it needs huge amount of storage space and processing power. In this paper, we ...
RECOMB
2005
Springer
15 years 11 months ago
2005
Springer
: A series of genome-scale algorithms and high-performance implementations is described and shown to be useful in the genetic analysis of gene transcription. With them it is possib...
GECCO
2009
Springer
15 years 5 months ago
2009
Springer
Genetic algorithms are often applied to combinatorial optimization problems, the most popular one probably being the traveling salesperson problem. In contrast to permutations use...
MOBICOM
2009
ACM
15 years 5 months ago
2009
ACM
The capacity scaling property specifies the changes in network throughput when network size increases and serves as an essential performance evaluation metric for large-scale wir...