153 search results - page 18 / 31 » Designing Goals for Online Role-Players |
CORR
2008
Springer
13 years 7 months ago
2008
Springer
In a multi-armed bandit problem, an online algorithm chooses from a set of strategies in a sequence of n trials so as to maximize the total payoff of the chosen strategies. While ...
SIAMJO
2008
13 years 7 months ago
2008
Abstract. We consider the offline and online versions of a bin packing problem called bin packing with conflicts. Given a set of items V = {1, 2, . . . , n} with sizes s1, s2 . . ....
EEE
2005
IEEE
14 years 1 months ago
2005
IEEE
Currently negotiation covers a huge and unstructured domain of negotiation- and coordination protocols and associated strategies. Researchers and practitioners like system enginee...
COMCOM
2010
13 years 6 months ago
2010
Understanding the relationship between queueing delays and link utilization for general traffic conditions is an important open problem in networking research. Difficulties in und...
IJRR
2010
13 years 6 months ago
2010
We introduce a detailed numerical simulation and analysis framework to extend the principles of passive dynamic walking to quadrupedal locomotion. Non-linear limit cycle methods a...