604 search results - page 6 / 121 » The Hardness of Metric Labeling |
ORL
2008
13 years 7 months ago
2008
![Searching the k-change neighborhood for TSP is W[1]-hard](https://www.sciweavers.org/files/imagecache/thumbnail/default/content.jpg "Searching the k-change neighborhood for TSP is W[1]-hard")
We show that searching the k-change neighborhood is W[1]-hard for metric TSP, which means that finding the best tour in the k-change neighborhood essentially requires complete sea...
SIGMETRICS
2006
ACM
14 years 2 months ago
2006
ACM
In this paper, we present a new metric, Hard-Fault Architectural Vulnerability Factor (H-AVF), to allow designers to more effectively compare alternate hard-fault tolerance scheme...
JAIR
2000
13 years 7 months ago
2000
We introduce a temporal model for reasoning on disjunctive metric constraints on intervals and time points in temporal contexts. This temporal model is composed of a labeled tempo...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Hardness results for maximum agreement problems have close connections to hardness results for proper learning in computational learning theory. In this paper we prove two hardnes...
KDD
2008
ACM
14 years 8 months ago
2008
ACM
This paper addresses the repeated acquisition of labels for data items when the labeling is imperfect. We examine the improvement (or lack thereof) in data quality via repeated la...