676 search results - page 27 / 136 » On Approximation Lower Bounds for TSP with Bounded Metrics |
FORMATS
2008
Springer
15 years 1 months ago
2008
Springer
This paper investigates the properties of Metric Temporal Logic (MTL) over models in which time is dense but phenomena are constrained to have bounded variability. Contrary to the ...
BIBE
2005
IEEE
15 years 5 months ago
2005
IEEE
We propose two novel dynamic programming (DP) methods that solve the the approximate bounded and unbounded global alignment problems for biological sequences. Our first method so...
NIPS
1998
15 years 1 months ago
1998
We study probabilistic inference in large, layered Bayesian networks represented as directed acyclic graphs. We show that the intractability of exact inference in such networks do...
DATE
1998
IEEE
15 years 4 months ago
1998
IEEE
We present an integer-linear-programming-based approach for estimating the maximum instantaneous current through the power supply lines for CMOS circuits. It produces the exact so...
COCOA
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. We study Facility Location games played by n agents situated on the nodes of a graph. Each agent orders installation of a facility at a node of the graph and pays connect...