Sciweavers

2496 search results - page 35 / 500
» On covering by translates of a set
Sort
View
COR
2000
129views more  COR 2000»
13 years 7 months ago
Heuristics for the multi-vehicle covering tour problem
The multi-vehicle covering tour problem is de"ned on a graph G"(<6=, E), where = is a set of vertices that must collectively be covered by up to m vehicles. The probl...
Mondher Hachicha, M. John Hodgson, Gilbert Laporte...
ICASSP
2010
IEEE
13 years 7 months ago
Cover song detection: From high scores to general classification
Existing cover song detection systems require prior knowledge of the number of cover songs in a test set in order to identify cover(s) to a reference song. We describe a system th...
Suman Ravuri, Daniel P. W. Ellis
MICS
2010
124views more  MICS 2010»
13 years 2 months ago
An Optimal Algorithm for the k-Fixed-Endpoint Path Cover on Proper Interval Graphs
In this paper we consider the k-fixed-endpoint path cover problem on proper interval graphs, which is a generalization of the path cover problem. Given a graph G and a set T of k v...
George B. Mertzios, Walter Unger
ML
2008
ACM
156views Machine Learning» more  ML 2008»
13 years 7 months ago
On the connection between the phase transition of the covering test and the learning success rate in ILP
It is well-known that heuristic search in ILP is prone to plateau phenomena. An explanation can be given after the work of Giordana and Saitta: the ILP covering test is NP-complete...
Érick Alphonse, Aomar Osmani
HEURISTICS
1998
103views more  HEURISTICS 1998»
13 years 7 months ago
Computing Approximate Solutions of the Maximum Covering Problem with GRASP
We consider the maximum covering problem, a combinatorial optimization problem that arises in many facility location problems. In this problem, a potential facility site covers a s...
Mauricio G. C. Resende