1310 search results - page 30 / 262 » A parallel genetic algorithm to solve the set-covering probl... |
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 ...
EMO
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. In this paper, we propose an approach for solving hierarchical multi-objective optimization problems (MOPs). In realistic MOPs, two main challenges have to be considered:...
IPPS
1998
IEEE
14 years 29 days ago
1998
IEEE
Given an (undirected) graph G = V; E; a clique of G is a subset of vertices in which every pair is connected by an edge. The problem of finding a clique of maximum size is a class...
KBS
2006
13 years 8 months ago
2006
We present a multi-objective genetic algorithm for mining highly predictive and comprehensible classification rules from large databases. We emphasize predictive accuracy and comp...
ENGL
2006
13 years 8 months ago
2006
Hybrid genetic algorithms have received significant interest in recent years and are being increasingly used to solve real-world problems. A genetic algorithm is able to incorporat...