798 search results - page 15 / 160 » Using Genetic Algorithms for Solving Hard Problems in GIS |
COCO
2008
Springer
13 years 10 months ago
2008
Springer
![Approximation of Natural W[P]-Complete Minimisation Problems Is Hard](https://www.sciweavers.org/files/imagecache/thumbnail/default/content.jpg "Approximation of Natural W[P]-Complete Minimisation Problems Is Hard")
We prove that the weighted monotone circuit satisfiability problem has no fixed-parameter tractable approximation algorithm with constant or polylogarithmic approximation ratio un...
ICCBR
2005
Springer
14 years 2 months ago
2005
Springer
We use case-injected genetic algorithms for learning how to competently play computer strategy games. Case-injected genetic algorithms combine genetic algorithm search with a case-...
IJON
2008
13 years 8 months ago
2008
In this paper, an approach to solving the classical Traveling Salesman Problem (TSP) using a recurrent network of linear threshold (LT) neurons is proposed. It maps the classical ...
GECCO
2008
Springer
13 years 9 months ago
2008
Springer
We investigated how indexed FOR-loops, such as the ones found in procedural programming languages, can be implemented in genetic programming. We use them to train programs that le...
SAC
2000
ACM
14 years 25 days ago
2000
ACM
The coding by which chromosomes represent candidate solutions is a fundamental design choice in a genetic algorithm. This paper describes a novel coding of spanning trees in a gen...