Search for dissertations about: "computer science games"

Showing result 16 - 20 of 59 swedish dissertations containing the words computer science games.

2. 16. Distributed Technology-Sustained Pervasive Applications

   Author : Kim J.L. Nevelsteen; Theo Kanter; Rahim Rahmani; Kåre Synnes; Stockholms universitet; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; pervasive; games; engine; distributed; virtual; world; internet of things; Computer and Systems Sciences; data- och systemvetenskap;

   Abstract : Technology-sustained pervasive games, contrary to technology-supported pervasive games, can be understood as computer games interfacing with the physical world. Pervasive games are known to make use of ‘non-standard input devices’ and with the rise of the Internet of Things (IoT), pervasive applications can be expected to move beyond games. READ MORE

4. 17. Mind Games Extended : Understanding Gameplay as Situated Activity

   Author : Jana Rambusch; Tom Ziemke; Tarja Susi; Ulf Wilhelmsson; T. L. Taylor; Högskolan i Skövde; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; computer gameplay; situatedness; embodied cognition; Teknik; Technology; TECHNOLOGY;

   Abstract : This thesis addresses computer gameplay activities in terms of the physical handling of a game, players’ meaning-making activities, and how these two processes are closely interrelated. It is examined in greater detail which role the body plays in gameplay, but also how gameplay is shaped by sociocultural factors outside the game, including different kind of tools and players’ participation in community practices. READ MORE

5. 18. Space in Proof Complexity

   Author : Marc Vinyals; Jakob Nordström; Yehudayoff Amir; KTH; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; proof complexity; resolution; polynomial calculus; cutting planes; space complexity; computational complexity; pebble games; communication complexity; CDCL; Computer Science; Datalogi;

   Abstract : ropositional proof complexity is the study of the resources that are needed to prove formulas in propositional logic. In this thesis we are concerned with the size and space of proofs, and in particular with the latter.Different approaches to reasoning are captured by corresponding proof systems. READ MORE

6. 19. Hardness of Approximating Constraint Satisfaction Problems and Their Variants in Presence of Additional Structural Assumptions

   Author : Aleksa Stankovic; Johan Håstad; Per Austrin; Luca Trevisan; KTH; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; Hardness of Approximation; Approximation Algorithms; Label Cover; Vertex Cover; Unique Games Conjecture; Max-3-Lin; Universal Factor Graphs; Regular Constraint Satisfaction Problems; Inapproximerbarhet; Approximationsalgoritm; Label Cover; Vertex Cover; Unique Games Conjecture; Max-3-Lin; Universell Faktorgraf; Regelbundna Begränsningsproblem; Datalogi; Computer Science;

   Abstract : This thesis studies how the approximability of some fundamental computational problems is affected by some additional requirements on the structure of the inputs. The problems studied in this thesis belong or are closely related to constraint satisfaction problems (CSPs), which are considered to be one of the most fundamental problems in theoretical computer science. READ MORE

7. 20. Designing Public Play : Playful Engagement, Constructed Activity, and Player Experience

   Author : Jon Back; Annika Waern; Barry Brown; José P. Zagal; Uppsala universitet; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; design; public; play; playful; playfulness; game; activity; experience; second order design; engage; engagement; fun; magic circle; brink games; pervasive games; place; space; co-creativity; empowerment; game jam; busking; street performance; playground; Human-Computer Interaction; Människa-dator interaktion;

   Abstract : This thesis sets out to explore why people engage in, and how to design for, play in a public setting. It does this by separating design for play from design of games, describing play as a socially and mentally understood activity, and a playful approach to engaging in that activity. READ MORE