50 search results - page 2 / 10 » An Improved Time-Sensitive Metaheuristic Framework for Combi... |
COMPSAC
2004
IEEE
13 years 9 months ago
2004
IEEE
While meta-heuristics are effective for solving large-scale combinatorial optimization problems, they result from time-consuming trial-and-error algorithm design tailored to speci...
ANOR
2004
13 years 5 months ago
2004
In this paper we introduce model-based search as a unifying framework accommodating some recently proposed metaheuristics for combinatorial optimization such as ant colony optimiza...
HIS
2008
13 years 6 months ago
2008
Haplotype Inference is a challenging problem in bioinformatics that consists in inferring the basic genetic constitution of diploid organisms on the basis of their genotype. This ...
ANOR
2010
13 years 5 months ago
2010
The design of effective neighborhood structures is fundamentally important for creating better local search and metaheuristic algorithms for combinatorial optimization. Significant...
ICASSP
2011
IEEE
12 years 9 months ago
2011
IEEE
Abstract—Widely distributed multiple radar architectures offer parameter estimation improvement for target localization. For a large number of radars, the achievable localization...