Sciweavers

1599 search results - page 275 / 320
» Algorithms for Parity Games
Sort
View
CCS
2006
ACM
15 years 1 months ago
Can machine learning be secure?
Machine learning systems offer unparalled flexibility in dealing with evolving input in a variety of applications, such as intrusion detection systems and spam e-mail filtering. H...
Marco Barreno, Blaine Nelson, Russell Sears, Antho...
COCO
2008
Springer
97views Algorithms» more  COCO 2008»
14 years 11 months ago
Generalized Tsirelson Inequalities, Commuting-Operator Provers, and Multi-prover Interactive Proof Systems
A central question in quantum information theory and computational complexity is how powerful nonlocal strategies are in cooperative games with imperfect information, such as mult...
Tsuyoshi Ito, Hirotada Kobayashi, Daniel Preda, Xi...
AAAI
2010
14 years 11 months ago
Dealing with Infinite Loops, Underestimation, and Overestimation of Depth-First Proof-Number Search
Depth-first proof-number search (df-pn) is powerful AND/OR tree search to solve positions in games. However, df-pn has a notorious problem of infinite loops when applied to domain...
Akihiro Kishimoto
AAAI
2004
14 years 11 months ago
Performance Bounded Reinforcement Learning in Strategic Interactions
Despite increasing deployment of agent technologies in several business and industry domains, user confidence in fully automated agent driven applications is noticeably lacking. T...
Bikramjit Banerjee, Jing Peng
AAAI
2006
14 years 11 months ago
Modeling Human Decision Making in Cliff-Edge Environments
In this paper we propose a model for human learning and decision making in environments of repeated Cliff-Edge (CE) interactions. In CE environments, which include common daily in...
Ron Katz, Sarit Kraus