1046 search results - page 56 / 210 » Approximation Algorithms for Domination Search |
119
Voted
RECOMB
2000
Springer
15 years 4 months ago
2000
Springer
We present a lossless compression algorithm, GenCompress, for genetic sequences, based on searching for approximate repeats. Our algorithm achieves the best compression ratios for...
87
Voted
WWW
2007
ACM
16 years 1 months ago
2007
ACM
We address the problem of measuring global quality metrics of search engines, like corpus size, index freshness, and density of duplicates in the corpus. The recently proposed est...
94
Voted
COR
2010
15 years 17 days ago
2010
We present a memetic approach for multi-objective improvement of robustness influencing features (called robustness objectives) in airline schedules. Improvement of the objectives...
JAIR
2006
15 years 13 days ago
2006
The best performing algorithms for a particular oversubscribed scheduling application, Air Force Satellite Control Network (AFSCN) scheduling, appear to have little in common. Yet...
AUSAI
2009
Springer
15 years 7 months ago
2009
Springer
In this paper we propose to use a distance metric based on user-preferences to efficiently find solutions for many-objective problems. In a user-preference based algorithm a decis...