2925 search results - page 50 / 585 » Information Complexity of Online Problems |
192
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
Combinatorial auctions have been studied by the multiagent systems community for some time, since these auctions are an effective mechanism for resource allocation when agents are...
178
click to vote
RAS
2008
15 years 5 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...
129
click to vote
SODA
2004
ACM
15 years 7 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...
184
click to vote
ITS
2004
Springer
15 years 11 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 ...
169
click to vote
RTSS
2003
IEEE
15 years 11 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...