18306 search results - page 160 / 3662 » Algorithmics in Exponential Time |
FOCS
1990
IEEE
15 years 2 months ago
1990
IEEE
The exponent of periodicity is an important factor in estimates of complexity of word-unification algorithms. We prove that the exponent of periodicity of a minimal solution of a w...
64
Voted
UM
2007
Springer
15 years 4 months ago
2007
Springer
There has been increasing interest in using games for education, but little investigation of how to model student learning within games [cf. 6]. We investigate how existing techniq...
COLT
2001
Springer
15 years 2 months ago
2001
Springer
In this paper we derive convergence rates for Q-learning. We show an interesting relationship between the convergence rate and the learning rate used in Q-learning. For a polynomi...
NIPS
1996
14 years 11 months ago
1996
It is shown that conventional computers can be exponentially faster than planar Hopfield networks: although there are planar Hopfield networks that take exponential time to conver...
TCC
2012
Springer
13 years 5 months ago
2012
Springer
We show a hardness-preserving construction of a PRF from any length doubling PRG which improves upon known constructions whenever we can put a non-trivial upper bound q on the numb...