One of the most classic algorithmic problems deals with calculating the shortest path between two points. A more complicated variant of the problem is when the route traverses a changing network - ...
Mathematics of Operations Research, Vol. 38, No. 2 (May 2013), pp. 209-227 (19 pages) We consider a totally asynchronous stochastic approximation algorithm, Q-learning, for solving finite space ...
This is a preview. Log in through your library . Abstract A general procedure is presented for computing the best, 2nd best, ⋯, Kth best solutions to a given discrete optimization problem. If the ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback