44 search results - page 2 / 9 » Bounding Rationality by Discounting Time |
CORR
2010
Springer
13 years 11 months ago
2010
Springer
In this paper we study planar polynomial differential systems of this form: dX dt = X = A(X, Y ), dY dt = Y = B(X, Y ), where A, B Z[X, Y ] and deg A d, deg B d, A H and B H. ...
EOR
2002
13 years 10 months ago
2002
We present a genetic algorithm for heuristically solving a cost minimization problem applied to communication networks with threshold based discounting. The network model assumes t...
ML
2002
ACM
13 years 10 months ago
2002
ACM
We present new algorithms for reinforcement learning, and prove that they have polynomial bounds on the resources required to achieve near-optimal return in general Markov decisio...
ICML
2005
IEEE
14 years 11 months ago
2005
IEEE
In this paper we consider sampling based fitted value iteration for discounted, large (possibly infinite) state space, finite action Markovian Decision Problems where only a gener...
ESA
1999
Springer
14 years 3 months ago
1999
Springer
We revisit classical geometric search problems under the assumption of rational coordinates. Our main result is a tight bound for point separation, ie, to determine whether n given...