715 search results - page 34 / 143 » Neighborhood structures for genetic local search algorithms |
IJNSEC
2007
14 years 9 months ago
2007
Various cryptosystems exploit exhaustive techniques to search, missing-the-mark, key space. Such search techniques should be guided in order to be computationally adequate. Here, ...
GECCO
2010
Springer
15 years 1 months ago
2010
Springer
A significant challenge in genetic programming is premature convergence to local optima, which often prevents evolution from solving problems. This paper introduces to genetic pro...
GECCO
2009
Springer
15 years 4 months ago
2009
Springer
Size and complexity of data repositories collaboratively created by Web users generate a need for new processing approaches. In this paper, we study the problem of detection of ï¬...
ICPR
2002
IEEE
15 years 10 months ago
2002
IEEE
In this work, two new techniques for non-linear feature extraction are presented. In these techniques, new features are obtained as radial projections of the original measurements...
AAAI
2010
14 years 11 months ago
2010
The problem of dividing a sequence of values into segments occurs in database systems, information retrieval, and knowledge management. The challenge is to select a finite number ...