1245 search results - page 6 / 249 » Playing with Conway's problem |
MFCS
2001
Springer
13 years 12 months ago
2001
Springer
Combinatorial games lead to several interesting, clean problems in algorithms and complexity theory, many of which remain open. The purpose of this paper is to provide an overview...
ITICSE
1999
ACM
13 years 11 months ago
1999
ACM
The paper addressesthe problem of making experiments for software engineering during laboratories. There is a need for experimental investigations. If experiments are performed in...
ISCIS
2004
Springer
14 years 26 days ago
2004
Springer
Abstract. We present a performance modelling case study of a distributed multi-player game expressed in the PEPA nets modelling language. The case study provides a modern complex d...
EWCBR
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. The problem of defining robot behaviors to completely address a large and complex set of situations is very challenging. We present an approach for robot's action se...
FOSSACS
2006
Springer
13 years 11 months ago
2006
Springer
We consider parity games played on special pushdown graphs, namely those generated by one-counter processes. For parity games on pushdown graphs, it is known from [22] that decidin...