Sciweavers

114 search results - page 11 / 23
» Interactive Proof Systems with Polynomially Bounded Strategi...
Sort
View
AI
2010
Springer
13 years 4 months ago
Robust solutions to Stackelberg games: Addressing bounded rationality and limited observations in human cognition
How do we build algorithms for agent interactions with human adversaries? Stackelberg games are natural models for many important applications that involve human interaction, such...
James Pita, Manish Jain, Milind Tambe, Fernando Or...
MATES
2005
Springer
14 years 1 months ago
A Goal Deliberation Strategy for BDI Agent Systems
One aspect of rational behavior is that agents can pursue multiple goals in parallel. Current BDI theory and systems do not provide a theoretical or architectural framework for dec...
Alexander Pokahr, Lars Braubach, Winfried Lamersdo...
CORR
2007
Springer
128views Education» more  CORR 2007»
13 years 7 months ago
Verified Real Number Calculations: A Library for Interval Arithmetic
—Real number calculations on elementary functions are remarkably difficult to handle in mechanical proofs. In this paper, we show how these calculations can be performed within a...
Marc Daumas, David Lester, César Muñ...
ICML
2009
IEEE
14 years 8 months ago
Near-Bayesian exploration in polynomial time
We consider the exploration/exploitation problem in reinforcement learning (RL). The Bayesian approach to model-based RL offers an elegant solution to this problem, by considering...
J. Zico Kolter, Andrew Y. Ng
FLAIRS
2004
13 years 9 months ago
Building Hint Specifications in an NL Tutorial System for Mathematics
NL interaction and skillful hinting are known as cornerstones for successful tutoring. Despite these insights, a combination of these two factors is widely under-represented in th...
Dimitra Tsovaltzi, Helmut Horacek, Armin Fiedler