Sciweavers

344 search results - page 33 / 69
» Banach-Mazur Games on Graphs
Sort
View
ICCS
2010
Springer
13 years 7 months ago
Default Conceptual Graph Rules, Atomic Negation and Tic-Tac-Toe
Abstract. In this paper, we explore the expressivity of default CG rules (a CGoriented subset of Reiter’s default logics) through two applications. In the first one, we show tha...
Jean-François Baget, Jérôme Fo...
IAT
2010
IEEE
13 years 6 months ago
Intention Recognition with Event Calculus Graphs
Intention recognition has significant applications in ambient intelligence, for example in assisted living and care of the elderly, in games and in intrusion and other crime detec...
Fariba Sadri
CPC
2008
51views more  CPC 2008»
13 years 8 months ago
Winning Fast in Sparse Graph Construction Games
A Graph Construction Game is a Maker-Breaker game. Maker and Breaker take turns in choosing previously unoccupied edges of the complete graph KN . Maker's aim is to claim a c...
Ohad N. Feldheim, Michael Krivelevich
ISSTA
2004
ACM
14 years 2 months ago
Optimal strategies for testing nondeterministic systems
This paper deals with testing of nondeterministic software systems. We assume that a model of the nondeterministic system is given by a directed graph with two kind of vertices: s...
Lev Nachmanson, Margus Veanes, Wolfram Schulte, Ni...
LICS
2008
IEEE
14 years 3 months ago
Winning Regions of Higher-Order Pushdown Games
In this paper we consider parity games defined by higher-order pushdown automata. These automata generalise pushdown automata by the use of higher-order stacks, which are nested ...
Arnaud Carayol, Matthew Hague, Antoine Meyer, C.-H...