Sciweavers

5230 search results - page 120 / 1046
» Dynamic Optimality -- Almost
Sort
View
SODA
2008
ACM
97views Algorithms» more  SODA 2008»
15 years 5 months ago
Stochastic analyses for online combinatorial optimization problems
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...
Naveen Garg, Anupam Gupta, Stefano Leonardi, Piotr...
112
Voted
SERP
2007
15 years 5 months ago
Runtime Support of Speculative Optimization for Offline Escape Analysis
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 ...
123
Voted
ISAAC
2004
Springer
91views Algorithms» more  ISAAC 2004»
15 years 9 months ago
Techniques for Indexing and Querying Temporal Observations for a Collection of Objects
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...
Qingmin Shi, Joseph JáJá
131
Voted
ISICT
2003
15 years 5 months ago
Applications considered harmful for ambient systems
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...
Simon Dobson
133
Voted
ICRA
2007
IEEE
127views Robotics» more  ICRA 2007»
15 years 10 months ago
A Dynamic Programming Approach to Redundancy Resolution with Multiple Criteria
— 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...