676 search results - page 88 / 136 » On Approximation Lower Bounds for TSP with Bounded Metrics |
WADS
2007
Springer
14 years 2 months ago
2007
Springer
Let G = (V, E) be an weighted undirected graph on n vertices and m edges, and let dG be its shortest path metric. We present two simple deterministic algorithms for approximating ...
AAAI
2008
13 years 11 months ago
2008
When controlling dynamic systems, such as mobile robots in uncertain environments, there is a trade off between risk and reward. For example, a race car can turn a corner faster b...
JAIR
2008
13 years 8 months ago
2008
Partially Observable Markov Decision Processes (POMDPs) provide a rich framework for sequential decision-making under uncertainty in stochastic domains. However, solving a POMDP i...
CORR
2011
Springer
13 years 3 months ago
2011
Springer
—We consider the problem of positioning a cloud of points in the Euclidean space Rd , from noisy measurements of a subset of pairwise distances. This task has applications in var...
SIGMOD
2008
ACM
14 years 9 months ago
2008
ACM
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...