241 search results - page 1 / 49 » Fast heuristics for large scale covering-location problems |
COR
2002
13 years 5 months ago
2002
We propose fast heuristics for large-scale covering-location problems in which the set of demand points is discrete and the set of potential location sites is continuous. These he...
ICPADS
2005
IEEE
13 years 11 months ago
2005
IEEE
: Accurate reconstruction of phylogenetic trees very often involves solving hard optimization problems, particularly the maximum parsimony (MP) and maximum likelihood (ML) problems...
SIAMSC
2011
13 years 7 days ago
2011
We consider the problem of estimating the uncertainty in large-scale linear statistical inverse problems with high-dimensional parameter spaces within the framework of Bayesian inf...
INFORMATICALT
2011
13 years 7 days ago
2011
Estimation and modelling problems as they arise in many data analysis areas often turn out to be unstable and/or intractable by standard numerical methods. Such problems frequently...
CSB
2004
IEEE
13 years 9 months ago
2004
IEEE
Phylogenetic trees are commonly reconstructed based on hard optimization problems such as maximum parsimony (MP) and maximum likelihood (ML). Conventional MP heuristics for produc...