6976 search results - page 146 / 1396 » The Oil Searching Problem |
192
click to vote
CEC
2008
IEEE
16 years 28 days ago
2008
IEEE
— Deceptive problems are a class of challenging problems for conventional genetic algorithms (GAs), which usually mislead the search to some local optima rather than the global o...
285
click to vote
LSSC
2007
Springer
16 years 18 days ago
2007
Springer
The Ant Colony Optimization (ACO) algorithms are being applied successfully to a wide range of problems. ACO algorithms could be good alternatives to existing algorithms for hard c...
183
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
Abstract. Nowadays genetic algorithms stand as a trend to solve NPcomplete and NP-hard problems. In this paper, we present a new hybrid metaheuristic which uses Parallel Genetic Al...
179
click to vote
EVOW
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We present the newly developed core concept for the Multidimensional Knapsack Problem (MKP) which is an extension of the classical concept for the one-dimensional case. T...
156
click to vote
AIPS
2006
15 years 7 months ago
2006
We investigate a task insertion heuristic for oversubscribed scheduling problems, max-availability, that uses a simple estimate of resource contention to assign tasks to intervals...