241 search results - page 3 / 49 » Fast heuristics for large scale covering-location problems |
CSB
2003
IEEE
14 years 4 months ago
2003
IEEE
The design of large scale DNA microarrays is a challenging problem. So far, probe selection algorithms must trade the ability to cope with large scale problems for a loss of accur...
BMCBI
2008
13 years 11 months ago
2008
Background: Due to recent progress in genome sequencing, more and more data for phylogenetic reconstruction based on rearrangement distances between genomes become available. Howe...
EUROCAST
2009
Springer
14 years 5 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
ICDCS
2009
IEEE
14 years 8 months ago
2009
IEEE
With the growing complexity in computer systems, it has been a real challenge to detect and diagnose problems in today’s large-scale distributed systems. Usually, the correlatio...
PAMI
2008
13 years 11 months ago
2008
We consider the problem of learning a ranking function that maximizes a generalization of the Wilcoxon-Mann-Whitney statistic on the training data. Relying on an -accurate approxim...