2180 search results - page 141 / 436 » Comparing bio-inspired algorithms in constrained optimizatio... |
147
click to vote
GECCO
2008
Springer
15 years 4 months ago
2008
Springer
We investigate a bi-variate probabilistic model-building GA for the graph bipartitioning problem. The graph bipartitioning problem is a grouping problem that requires some modifi...
119
click to vote
ICDAR
2003
IEEE
15 years 8 months ago
2003
IEEE
This paper proposes a binary classification tree aiming at solving multi-class classification problems using binary classifiers. The tree design is achieved in a way that a class ...
122
click to vote
GECCO
2008
Springer
15 years 4 months ago
2008
Springer
This paper presents a variant of Quantum behaved Particle Swarm Optimization (QPSO) named Q-QPSO for solving global optimization problems. The Q-QPSO algorithm is based on the cha...
133
click to vote
CPM
2005
Springer
15 years 8 months ago
2005
Springer
In this paper we propose new solution methods for designing tag sets for use in universal DNA arrays. First, we give integer linear programming formulations for two previous formal...
152
click to vote
CSC
2009
15 years 4 months ago
2009
- The Traveling Salesman Problem (TSP) is perhaps the most famous optimization problem in the set NP-hard. Many problems that are natural applications in computer science and engin...