676 search results - page 18 / 136 » On Approximation Lower Bounds for TSP with Bounded Metrics |
TACAS
2009
Springer
15 years 6 months ago
2009
Springer
The ITPN-PerfBound is a tool for the modeling and analysis of Interval Time Petri Nets (ITPN), that is Petri Nets in which firing time intervals, and possibly firing frequency in...
ADC
2006
Springer
15 years 5 months ago
2006
Springer
Many strategies for similarity search in image databases assume a metric and quadratic form-based similarity model where an optimal lower bounding distance function exists for fil...
105
click to vote
FOCS
2006
IEEE
15 years 5 months ago
2006
IEEE
An additive spanner of an unweighted undirected graph G with distortion d is a subgraph H such that for any two vertices u, v ∈ G, we have δH(u, v) ≤ δG(u, v) + d. For every...
NIPS
2008
15 years 1 months ago
2008
Most algorithms for solving Markov decision processes rely on a discount factor, which ensures their convergence. It is generally assumed that using an artificially low discount f...
COCO
2007
Springer
15 years 5 months ago
2007
Springer
This paper presents a unified and simple treatment of basic questions concerning two computational models: multiparty communication complexity and GF(2) polynomials. The key is t...