715 search results - page 40 / 143 » Neighborhood structures for genetic local search algorithms |
IJIT
2004
14 years 11 months ago
2004
In this contribution, the use of a new genetic operator is proposed. The main advantage of using this operator is that it is able to assist the evolution procedure to converge fast...
DAM
2008
14 years 9 months ago
2008
Let G = (V, E) be a graph with vertex set V and edge set E. The k-coloring problem is to assign a color (a number chosen in {1, . . . , k}) to each vertex of G so that no edge has...
106
click to vote
TKDE
2008
14 years 9 months ago
2008
One of the fundamental problems in Content-Based Image Retrieval (CBIR) has been the gap between low-level visual features and high-level semantic concepts. To narrow down this gap...
ISDA
2009
IEEE
15 years 4 months ago
2009
IEEE
—Web Services are interfaces that describe a collection of operations that are network-accessible through standardized web protocols. When a required operation is not found, seve...
104
click to vote
CEC
2008
IEEE
15 years 4 months ago
2008
IEEE
— Deceptive problems are a class of challenging problems for conventional genetic algorithms (GAs), which usually mislead the search to some local optima rather than the global o...