2095 search results - page 4 / 419 » Improved pebbling bounds |
CORR
2012
Springer
12 years 3 months ago
2012
Springer
We develop a new method for proving explicit approximation lower bounds for TSP problems with bounded metrics improving on the best up to now known bounds. They almost match the b...
CSR
2011
Springer
12 years 11 months ago
2011
Springer
Abstract. Many theorems about Kolmogorov complexity rely on existence of combinatorial objects with specific properties. Usually the probabilistic method gives such objects with b...
MFCS
2009
Springer
14 years 2 months ago
2009
Springer
We introduce the tree evaluation problem, show that it is in LogDCFL (and hence in P), and study its branching program complexity in the hope of eventually proving a superlogarith...
ECAI
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. This paper extends previously proposed bound propagation algorithm [11] for computing lower and upper bounds on posterior marginals in Bayesian networks. We improve the b...
AAAI
2007
13 years 9 months ago
2007
We consider problems of geometric exploration and selfdeployment for simple robots that can only sense the combinatorial (non-metric) features of their surroundings. Even with suc...