7106 search results - page 285 / 1422 » Restricted Complexity, General Complexity |
155
Voted
STACS
2004
Springer
15 years 10 months ago
2004
Springer
An Active Context-Free Game is a game with two players (Romeo and Juliet) on strings over a finite alphabet. In each move, Juliet selects a position of the current word and Romeo ...
151
click to vote
FUN
2010
Springer
15 years 9 months ago
2010
Springer
UNOR is one of the world-wide well-known and popular card games. We investigate UNO from the viewpoint of combinatorial algorithmic game theory by giving some simple and concise ma...
163
Voted
CC
2001
Springer
15 years 9 months ago
2001
Springer
Abstract. We present a method of specifying standard imperative program optimisations as a rewrite system. To achieve this we have extended the idea of matching sub-terms in expres...
135
click to vote
ICC
2000
IEEE
15 years 9 months ago
2000
IEEE
— This paper proposes a numerical method for characterizing the achievable rate region for a Gaussian multiple access channel with ISI under the frequency division multiple acces...
134
click to vote
CSR
2010
Springer
15 years 8 months ago
2010
Springer
We study one-head machines through symbolic and topological dynamics. In particular, a subshift is associated to the subshift, and we are interested in its complexity in terms of r...