The fastest known algorithm for solving General Bayesian Stackelberg games with a finite set of follower (adversary) types have seen direct practical use at the LAX airport for o...
Manish Jain, Christopher Kiekintveld, Milind Tambe
Many of today's Web applications support just simple trial-anderror retrievals: supply one set of parameters, obtain one set of results. For a user who wants to examine a num...
d Abstraction for Messaging on the Semantic Web Dennis Quan IBM Internet Technology 1 Rogers Street Cambridge, MA 02142 USA dennisq@us.ibm.com Karun Bakshi MIT Artificial Intellige...
Can implicit interaction with a computer easily drive useful interface improvements in physical world settings? This paper presents a case study presenting multiple such context-a...
Reinforcement learning algorithms that use eligibility traces, such as Sarsa(λ), have been empirically shown to be effective in learning good estimated-state-based policies in pa...