208 search results - page 40 / 42 » Evolutionary algorithms and multi-objectivization for the tr... |
EMO
2001
Springer
14 years 4 days ago
2001
Springer
One common characterization of how simple hill-climbing optimization methods can fail is that they become trapped in local optima - a state where no small modi cation of the curren...
EVOW
2004
Springer
14 years 1 months ago
2004
Springer
Genetic Algorithms (GAs) are well-known heuristic algorithms and have been widely applied to solve combinatorial problems. Edge recombination is one of the famous crossovers design...
FOCS
2003
IEEE
14 years 28 days ago
2003
IEEE
A directed multigraph is said to be d-regular if the indegree and outdegree of every vertex is exactly d. By Hall’s theorem one can represent such a multigraph as a combination ...
BMCBI
2008
13 years 7 months ago
2008
Background: The analysis of large-scale data sets via clustering techniques is utilized in a number of applications. Biclustering in particular has emerged as an important problem...
AAAI
1998
13 years 9 months ago
1998
Probabilistic models have recently been utilized for the optimization of large combinatorial search problems. However, complex probabilistic models that attempt to capture interpa...