We introduce an online relocation problem on a graph, in which a player who walks around the nodes makes decisions on whether to relocate mobile resources, while not knowing the fu...
1 We consider the problem of scheduling an unknown sequence of tasks for a single server as the tasks arrive with the goal off maximizing the total weighted value of the tasks serv...
: In this article we present the development of a web application called SHARP Online: An Adaptive Hypermedia System Applied to Mathematical Problem Solving. The pedagogical basis ...
We describe a new method for pruning in dynamic models based on running an adaptive filtering algorithm online during decoding to predict aspects of the scores in the near future....
We study the online problem of holding a number of idle threads on an application server, which we have ready for processing new requests. The problem stems from the fact that bot...