Sciweavers

1953 search results - page 308 / 391
» Normative system games
Sort
View
COCO
1994
Springer
140views Algorithms» more  COCO 1994»
15 years 7 months ago
Random Debaters and the Hardness of Approximating Stochastic Functions
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
Anne Condon, Joan Feigenbaum, Carsten Lund, Peter ...
136
Voted
COCO
2010
Springer
129views Algorithms» more  COCO 2010»
15 years 7 months ago
On the Relative Strength of Pebbling and Resolution
The last decade has seen a revival of interest in pebble games in the context of proof complexity. Pebbling has proven to be a useful tool for studying resolution-based proof syst...
Jakob Nordström
142
Voted
AI
2010
Springer
15 years 1 months ago
Agent decision-making in open mixed networks
Computer systems increasingly carry out tasks in mixed networks, that is in group settings in which they interact both with other computer systems and with people. Participants in...
Ya'akov Gal, Barbara J. Grosz, Sarit Kraus, Avi Pf...
CHI
2009
ACM
16 years 4 months ago
Automatic storytelling in comics: a case study on World of Warcraft
Chia-Jung Chan This paper presents a development of our comic generation system that automatically summarizes players' actions and interactions in the virtual world. The featu...
Chia-Jung Chan, Ruck Thawonmas, Kuan-Ta Chen
141
Voted
ATAL
2009
Springer
15 years 10 months ago
Pragmatic-strategic reputation-based decisions in BDI agents
Computational trust and reputation models have been recognized as one of the key technologies required to design and implement agent systems. These models manage and aggregate the...
Isaac Pinyol, Jordi Sabater-Mir