Sciweavers

1176 search results - page 123 / 236
» Exploiting Online Games
Sort
View
LION
2010
Springer
190views Optimization» more  LION 2010»
15 years 4 months ago
Algorithm Selection as a Bandit Problem with Unbounded Losses
Abstract. Algorithm selection is typically based on models of algorithm performance learned during a separate offline training sequence, which can be prohibitively expensive. In r...
Matteo Gagliolo, Jürgen Schmidhuber
NGC
2000
Springer
109views Communications» more  NGC 2000»
15 years 4 months ago
Router level filtering for receiver interest delivery
Delivering data to on-line game participants requires the game data to be "customized" in real-time to each participant's characteristics. Using multicast in such a...
Manuel M. Oliveira, Jon Crowcroft, Christophe Diot
101
Voted
DSRT
2009
IEEE
15 years 4 months ago
An Approach for Parallel Interest Matching in Distributed Virtual Environments
—Interest management is essential for real-time large-scale distributed virtual environments (DVEs) which seeks to filter irrelevant messages on the network. Many existing inter...
Elvis S. Liu, Georgios K. Theodoropoulos
ATAL
2008
Springer
15 years 2 months ago
Understanding how people design trading agents over time
As computerized agents are becoming more and more common, e-commerce becomes a major candidate for incorporation of automated agents. Thus, it is vital to understand how people de...
Efrat Manisterski, Raz Lin, Sarit Kraus
124
Voted
COCOON
2008
Springer
15 years 2 months ago
Average-Case Competitive Analyses for One-Way Trading
Consider a trader who exchanges one dollar into yen and assume that the exchange rate fluctuates within the interval [m, M]. The game ends without advance notice, then the trader ...
Hiroshi Fujiwara, Kazuo Iwama, Yoshiyuki Sekiguchi