In this paper, we study online algorithms when the input is not chosen adversarially, but consists of draws from some given probability distribution. While this model has been stu...
Escape analysis can improve the speed and memory efficiency of garbage collected languages by allocating objects to the call stack, but an offline analysis will potentially interf...
Kevin Cleereman, Michelle Cheatham, Krishnaprasad ...
We consider the problem of dynamically indexing temporal observations about a collection of objects, each observation consisting of a key identifying the object, a list of attribu...
The notion of application – a single, bounded piece of functionality presented to users – goes almost unquestioned. However in the context of highly adaptive and ambient system...
— This paper addresses the problem of generating optimal joint trajectories for redundant manipulators when multiple criteria are to be considered. A dynamic programming approach...
A. Guigue, Mojtaba Ahmadi, M. J. D. Hayes, R. Lang...