A canonical problem in computer science is to find the shortest route to every point in a network. A new approach beats the ...

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 ...

Solving the riddle can reduce electric car battery consumption and make life tougher for currency speculators in the future. The discovery has just won the award for best research article and was ...

Military Operations Research, Vol. 14, No. 3 (2009), pp. 31-52 (22 pages) We formulate and solve aircraftrouting problems that arise when planning missions for military aircraft that are subject to ...