376 search results - page 21 / 76 » On the Advice Complexity of Online Problems |
101
click to vote
RAS
2008
14 years 11 months ago
2008
The generation of trajectories for a biped robot is a problem which has been largely studied for several years, and many satisfying off-line solutions exist for steady-state walki...
SODA
2004
ACM
15 years 1 months ago
2004
ACM
We close the gaps between known lower and upper bounds for the online partial-sums problem in the RAM and group models of computation. If elements are chosen from an abstract grou...
RTSS
2003
IEEE
15 years 5 months ago
2003
IEEE
The Pfair algorithms are optimal for independent periodic real-time tasks executing on a multiple-resource system, however, they incur a high scheduling overhead by making schedul...
109
click to vote
ITS
2004
Springer
15 years 5 months ago
2004
Springer
This research describes a probabilistic approach for developing predictive models of how students learn problem-solving skills in general qualitative chemistry. The goal is to use ...
105
click to vote
TCC
2009
Springer
16 years 7 days ago
2009
Springer
We consider the problem of memory checking, where a user wants to maintain a large database on a remote server but has only limited local storage. The user wants to use the small ...