676 search results - page 108 / 136 » On Approximation Lower Bounds for TSP with Bounded Metrics |
LICS
2005
IEEE
14 years 1 months ago
2005
IEEE
We construct a domain-theoretic calculus for Lipschitz and differentiable functions, which includes addition, subtraction and composition. We then develop a domaintheoretic versio...
ICLP
1997
Springer
13 years 11 months ago
1997
Springer
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
NN
1997
Springer
13 years 11 months ago
1997
Springer
Bayesian networks are directed acyclic graphs that represent dependencies between variables in a probabilistic model. Many time series models, including the hidden Markov models (H...
CIAC
1994
Springer
13 years 11 months ago
1994
Springer
We consider the problem of maintaining a binary search tree (BST) that minimizes the average access cost needed to satisfy randomly generated requests. We analyze scenarios in whi...
LATIN
2010
Springer
13 years 9 months ago
2010
Springer
We study the problem of designing truthful algorithms for scheduling a set of tasks, each one owned by a selfish agent, to a set of parallel (identical or unrelated) machines in or...