Sciweavers

164 search results - page 7 / 33
» Selecting Robust Strategies Based on Abstracted Game Models
Sort
View
165
Voted
AIIDE
2009
15 years 3 months ago
Examining Extended Dynamic Scripting in a Tactical Game Framework
Dynamic scripting is a reinforcement learning algorithm designed specifically to learn appropriate tactics for an agent in a modern computer game, such as Neverwinter Nights. This...
Jeremy Ludwig, Arthur Farley
122
Voted
SIAMJO
2008
104views more  SIAMJO 2008»
15 years 1 months ago
A Minimax Theorem with Applications to Machine Learning, Signal Processing, and Finance
This paper concerns a fractional function of the form xT a/ xT Bx, where B is positive definite. We consider the game of choosing x from a convex set, to maximize the function, an...
Seung-Jean Kim, Stephen P. Boyd
108
Voted
IWANN
2005
Springer
15 years 7 months ago
Direct and Recursive Prediction of Time Series Using Mutual Information Selection
Abstract. This paper presents a comparison between direct and recursive prediction strategies. In order to perform the input selection, an approach based on mutual information is u...
Yongnan Ji, Jin Hao, Nima Reyhani, Amaury Lendasse
CONCUR
2007
Springer
15 years 8 months ago
Timed Concurrent Game Structures
Abstract. We propose a new model for timed games, based on concurrent game structures (CGSs). Compared to the classical timed game automata of Asarin et al. [8], our timed CGSs are...
Thomas Brihaye, François Laroussinie, Nicol...
96
Voted
IOR
2002
112views more  IOR 2002»
15 years 1 months ago
Interdisciplinary Meandering in Science
abstract mathematics. My mentor was Professor S. Bochner, a distinguished contributor to harmonic analysis. My classmates included Richard Bellman (who later nurtured the method of...
Samuel Karlin