— The application of on-line learning techniques to modern computer games is a promising research direction. In fact, they can be used to improve the game experience and to achie...
Luigi Cardamone, Daniele Loiacono, Pier Luca Lanzi
We consider the problem of scheduling a maximum profit selection of equal length jobs on m identical machines. Jobs arrive online over time and the goal is to determine a non-pre...
Sven Oliver Krumke, Alfred Taudes, Stephan Westpha...
We examine the classic on-line bipartite matching problem studied by Karp, Vazirani, and Vazirani [8] and provide a simple proof of their result that the Ranking algorithm for thi...
The max k-armed bandit problem is a recently-introduced online optimization problem with practical applications to heuristic search. Given a set of k slot machines, each yielding p...
Using a combination of machine learning probabilistic tools, we have shown that some chemistry students fail to develop productive problem solving strategies through practice alon...
Ron Stevens, Amy Soller, Alessandra Giordani, Luca...