In many information systems, the databases that make up the system are distributed in different modules or branch offices according to the requirements of the business enterprise. ...
Since web workloads are known to vary dynamically with time, in this paper, we argue that dynamic resource allocation techniques are necessary to provide guarantees to web applicat...
The iterative closest point (ICP) algorithm is widely used for the registration of geometric data. One of its main drawbacks is its quadratic time complexity O(N2 ) with the shape...
This paper describes TEMPEST, a planner that enables a solar-powered rover to reason about path selection and event placement in terms of available solar energy and anticipated po...
We have recently introduced an incremental learning algorithm, Learn++ .NSE, for Non-Stationary Environments, where the data distribution changes over time due to concept drift. Le...