798 search results - page 6 / 160 » Using Genetic Algorithms for Solving Hard Problems in GIS |
IFIP
2004
Springer
14 years 1 months ago
2004
Springer
Geometrical place can be sometimes difficult to find by applying mathematical methods. Evolutionary algorithms deal with a population of solutions. This population (initially ran...
SAC
2004
ACM
14 years 1 months ago
2004
ACM
Some telecommunication systems can not afford the cost of repeating a corrupted message. Instead, the message should be somewhat “corrected” by the receiver. In these cases a...
GECCO
2009
Springer
13 years 6 months ago
2009
Springer
An iterated function f(x) is a function that when composed with itself, produces a given expression f(f(x))=g(x). Iterated functions are essential constructs in fractal theory and...
CEC
2008
IEEE
14 years 2 months ago
2008
IEEE
—Correlation clustering problem is a NP hard problem and technologies for the solving of correlation clustering problem can be used to cluster given data set with relation matrix...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
During our earlier research, it was recognised that in order to be successful with an indirect genetic algorithm approach using a decoder, the decoder has to strike a balance betw...