676 search results - page 88 / 136 » On Approximation Lower Bounds for TSP with Bounded Metrics |
129
click to vote
WADS
2007
Springer
15 years 8 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 ...
158
click to vote
AAAI
2008
15 years 4 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...
108
click to vote
JAIR
2008
15 years 1 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...
141
click to vote
CORR
2011
Springer
14 years 9 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...
219
click to vote
SIGMOD
2008
ACM
16 years 2 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...