1639 search results - page 114 / 328 » Anytime Heuristic Search |
IPPS
1997
IEEE
14 years 2 months ago
1997
IEEE
The 0 1 MultidimensionalKnapsack Problem (0 1 MKP) is a NP-complete problem. Its resolution for large scale instances requires a prohibitive processing time. In this paper we prop...
ANOR
2010
13 years 10 months ago
2010
We consider the linear classification method consisting of separating two sets of points in d-space by a hyperplane. We wish to determine the hyperplane which minimises the sum of...
COCOON
2007
Springer
14 years 4 months ago
2007
Springer
Given an RNA family characterized by conserved sequences and folding constraints, the problem is to search for all the instances of the RNA family in a genomic database. As seed-ba...
GECCO
2007
Springer
14 years 4 months ago
2007
Springer
Modularity is thought to improve the evolvability of biological systems [18, 22]. Recent studies in the field of evolutionary computation show that the use of modularity improves...
SLS
2007
Springer
14 years 4 months ago
2007
Springer
We consider a possible scenario of experimental analysis on heuristics for optimization: identifying the contribution of local search components when algorithms are evaluated on th...