Sciweavers

355 search results - page 64 / 71
» On Ramsey-type positional games
Sort
View
LPNMR
1999
Springer
13 years 11 months ago
On the Role of Negation in Choice Logic Programs
We introduce choice logic programs as negation-free datalog programs that allow rules to have exclusive-only (possibly empty) disjunctions in the head. Such programs naturally mod...
Marina De Vos, Dirk Vermeir
COCO
1991
Springer
112views Algorithms» more  COCO 1991»
13 years 11 months ago
Randomized vs.Deterministic Decision Tree Complexity for Read-Once Boolean Functions
We consider the deterministic and the randomized decision tree complexities for Boolean functions, denoted DC(f) and RC(f), respectively. A major open problem is how small RC(f) ca...
Rafi Heiman, Avi Wigderson
FPLAY
2008
13 years 9 months ago
Flow and immersion in first-person shooters: measuring the player's gameplay experience
Researching experiential phenomena is a challenging undertaking, given the sheer variety of experiences that are described by gamers and missing a formal taxonomy: flow, immersion...
Lennart Nacke, Craig A. Lindley
AAAI
2010
13 years 9 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
JUCS
2007
133views more  JUCS 2007»
13 years 7 months ago
Building Immersive Conversation Environment Using Locomotive Interactive Character
: Generating composite human motion such as locomotion and gestures is important for interactive applications, such as interactive storytelling and computer games. In interactive s...
Rai Chan, Junichi Hoshino