480 search results - page 54 / 96 » Approximate and exact algorithms for the fixed-charge knapsa... |
CPM
2000
Springer
14 years 1 months ago
2000
Springer
The syntenic dista nce between two species is the minimum number of fusions, fissions, and translocations required to transform one genome into the other. The linear syntenic dis...
MICAI
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. Kernel based methods (such as k-nearest neighbors classifiers) for AI tasks translate the classification problem into a proximity search problem, in a space that is usu...
TCS
2011
13 years 4 months ago
2011
The problem of computing minimum distortion embeddings of a given graph into a line (path) was introduced in 2004 and has quickly attracted significant attention with subsequent ...
UAI
2000
2000
Probabilistic Arc Consistency: A Connection between Constraint Reasoning and Probabilistic Reasoning
13 years 10 months ago
We document a connection between constraint reasoning and probabilistic reasoning. We present an algorithm, called probabilistic arc consistency, which is both a generalization of...
ESA
2006
Springer
14 years 22 days ago
2006
Springer
Abstract. We consider the problem of finding shortest paths in a graph with independent randomly distributed edge lengths. Our goal is to maximize the probability that the path len...