1263 search results - page 20 / 253 » A* with Bounded Costs |
73
Voted
CRYPTO
2009
Springer
15 years 4 months ago
2009
Springer
We prove the equivalence, up to a small polynomial approximation factor n/ log n, of the lattice problems uSVP (unique Shortest Vector Problem), BDD (Bounded Distance Decoding) and...
116
click to vote
ECCC
2011
14 years 4 months ago
2011
In recent results the complexity of isomorphism testing on graphs of bounded treewidth is improved to TC1 [GV06] and further to LogCFL [DTW10]. The computation of canonical forms ...
NIPS
2004
14 years 11 months ago
2004
In the multi-armed bandit problem, an online algorithm must choose from a set of strategies in a sequence of n trials so as to minimize the total cost of the chosen strategies. Wh...
73
Voted
FOCS
1993
IEEE
15 years 1 months ago
1993
IEEE
This paper investigates the computational complexity of approximating several NPoptimization problems using the number of queries to an NP oracle as a complexity measure. The resu...
ALGORITHMICA
1998
14 years 9 months ago
1998
We consider the problem of dynamic reorganization of a linear list, where requests for the elements are generated randomly with fixed, unknown probabilities. The objective is to ...