Materializing results from complex aggregation queries helps to significantly improve response times in OLAP servers. This problem is known as the view selection problem: choosing ...
We attend to the classic setting where an observer needs to inform a tracker about an arbitrary time varying function f : N0 → Z. This is an optimization problem, where both wron...
d by an application in thinwire visualization, we study an abstract on-line scheduling problem where the size of each requested service can be scaled down by the scheduler. Thus o...
We address the problem of online route discovery for a class of graphs that can be embedded either in two or in three dimensional space. In two dimensions we propose the class of ...
This paper is the first of a two paper series that deals with an important problem in on-line learning mechanisms for autonomous agents that must perform non trivial tasks and oper...