Sciweavers

800 search results - page 26 / 160
» On the Complexity of Parity Games
Sort
View
IANDC
2006
113views more  IANDC 2006»
13 years 9 months ago
Automata and fixed point logic: A coalgebraic perspective
This paper generalizes existing connections between automata and logic to a coalgestraction level. Let F : Set Set be a standard functor that preserves weak pullbacks. We introdu...
Yde Venema
ENDM
2010
87views more  ENDM 2010»
13 years 9 months ago
Euler Complexes (Oiks)
We present a class of instances of the existence of a second object of a specified type, in fact, of an even number of objects of a specified type, which generalizes the existence...
Jack Edmonds
ALT
2008
Springer
14 years 6 months ago
On-Line Probability, Complexity and Randomness
Abstract. Classical probability theory considers probability distributions that assign probabilities to all events (at least in the finite case). However, there are natural situat...
Alexey V. Chernov, Alexander Shen, Nikolai K. Vere...
IM
2007
13 years 9 months ago
Pursuit-Evasion in Models of Complex Networks
Vertex pursuit games, such as the game of Cops and Robbers, are a simplified model for network security. In these games, cops try to capture a robber loose on the vertices of the ...
Anthony Bonato, Pawel Pralat, Changping Wang
SIGMOD
2008
ACM
141views Database» more  SIGMOD 2008»
14 years 9 months ago
SGL: a scalable language for data-driven games
We propose to demonstrate SGL, a language and system for writing computer games using data management techniques. We will demonstrate a complete game built using the system, and s...
Robert Albright, Alan J. Demers, Johannes Gehrke, ...