693 search results - page 43 / 139 » Complexity Analysis of Heuristic CSP Search Algorithms |
126
click to vote
PODS
2008
ACM
16 years 4 months ago
2008
ACM
Co-clustering is the simultaneous partitioning of the rows and columns of a matrix such that the blocks induced by the row/column partitions are good clusters. Motivated by severa...
136
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Based on speculations coming from statistical mechanics and the conjectured existence of critical states, I propose a simple heuristic in order to control the mutation probability...
150
click to vote
IPPS
2010
IEEE
15 years 1 months ago
2010
IEEE
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
118
click to vote
GECCO
2008
Springer
15 years 4 months ago
2008
Springer
We propose a network characterization of combinatorial fitness landscapes by adapting the notion of inherent networks proposed for energy surfaces [5]. We use the well-known fami...
150
click to vote
GECCO
2008
Springer
15 years 4 months ago
2008
Springer
We show how and why using genetic operators that are applied with probabilities that depend on the fitness rank of a genotype or phenotype offers a robust alternative to the Sim...