1220 search results - page 75 / 244 » Restricting grammatical complexity |
PPAM
2005
Springer
14 years 1 months ago
2005
Springer
Grid resource allocation is a complex task that is usually solved by systems relying on a centralized information system. In order to create a lightweight scheduling system, we inv...
STACS
2004
Springer
14 years 1 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 ...
FUN
2010
Springer
14 years 16 days 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...
CC
2001
Springer
14 years 7 days 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...
PPAM
2001
Springer
14 years 4 days ago
2001
Springer
Abstract. This paper investigates the complexity of scheduling biprocessor tasks on dedicated processors to minimize mean flow time. Since the general problem is strongly NP-hard,...