Sciweavers

511 search results - page 43 / 103
» TSP with bounded metrics
Sort
View
FOCS
2007
IEEE
15 years 4 months ago
On the Optimality of Planar and Geometric Approximation Schemes
We show for several planar and geometric problems that the best known approximation schemes are essentially optimal with respect to the dependence on ǫ. For example, we show that...
Dániel Marx
SEFM
2007
IEEE
15 years 4 months ago
Hardness for Explicit State Software Model Checking Benchmarks
Directed model checking algorithms focus computation resources in the error-prone areas of concurrent systems. The algorithms depend on some empirical analysis to report their per...
Neha Rungta, Eric G. Mercer
IWFM
2003
172views Formal Methods» more  IWFM 2003»
14 years 11 months ago
On Continuous Models of Computation: Towards Computing the Distance Between (Logic) Programs
We present a report on work in progress on certain aspects of a programme of research concerned with building formal, mathematical models both for aspects of the computational pro...
Anthony Karel Seda, Máire Lane
SODA
2000
ACM
123views Algorithms» more  SODA 2000»
14 years 11 months ago
Communication complexity of document exchange
We address the problem of minimizing the communication involved in the exchange of similar documents. We consider two users, A and B, who hold documents x and y respectively. Neit...
Graham Cormode, Mike Paterson, Süleyman Cenk ...
TSP
2010
14 years 4 months ago
Distributed learning in multi-armed bandit with multiple players
We formulate and study a decentralized multi-armed bandit (MAB) problem. There are distributed players competing for independent arms. Each arm, when played, offers i.i.d. reward a...
Keqin Liu, Qing Zhao