2244 search results - page 101 / 449 » A new heuristic approach for non-convex optimization problem... |
173
click to vote
EVOW
2004
Springer
15 years 11 months ago
2004
Springer
This paper introduces a new social metaheuristic for the Max-Cut problem applied to a weighted undirected graph. This problem consists in finding a partition of the nodes into two ...
150
click to vote
CEC
2009
IEEE
16 years 1 months ago
2009
IEEE
— This paper attempts to address the question of scaling up Particle Swarm Optimization (PSO) algorithms to high dimensional optimization problems. We present a cooperative coevo...
138
click to vote
AIPS
2006
15 years 7 months ago
2006
We present a new approach to optimal rectangle packing, an NP-complete problem that can be used to model many simple scheduling tasks. Recent attempts at incorporating artificial ...
155
click to vote
WABI
2007
Springer
16 years 12 days ago
2007
Springer
The aim of the motif recognition problem is to detect a set of mutually similar subsequences within a collection of biological sequences. The weak motif recognition problem on DNA ...
165
click to vote
CP
2008
Springer
15 years 8 months ago
2008
Springer
Decomposition is a powerful technique for reducing the size of a backtracking search tree. However, when solving constraint optimization problems (COP's) the standard techniqu...