152 search results - page 4 / 31 » An Experimental Study of Random Knapsack Problems |
GECCO
2004
Springer
14 years 2 days ago
2004
Springer
In this study, a new mechanism that adapts the mutation rate for each locus on the chromosomes, based on feedback obtained from the current population is proposed. Through tests us...
IJAMCIGI
2010
13 years 1 months ago
2010
We present an experimental investigation of tabu search (TS) to solve the 3-coloring problem (3-COL). Computational results reveal that a basic TS algorithm is able to find proper ...
CSCLP
2005
Springer
14 years 6 days ago
2005
Springer
Problems that can be sampled randomly are a good source of test suites for comparing quality of constraint satisfaction techniques. Quasigroup problems are representatives of struc...
CSCLP
2003
Springer
13 years 12 months ago
2003
Springer
Abstract. In [8], Freuder defined interchangeability for classical Constraint Satisfaction Problems (CSPs). Recently [2], we extended the definition of interchangeability to Soft ...
CP
1998
Springer
13 years 11 months ago
1998
Springer
Abstract. We study the experimental consequences of a recent theoretical result by Achlioptas et al. that shows that conventional models of random problems are trivially insoluble ...