1404 search results - page 231 / 281 » Complexity of admissible rules |
FCT
1999
Springer
14 years 29 days ago
1999
Springer
The aim of this paper is to investigate the relation between two models of concurrent systems: tile rewrite systems and coalgebras. Tiles are rewrite rules with side e ects which a...
TOOLS
1999
IEEE
14 years 29 days ago
1999
IEEE
The evolution of software systems over many years often leads to unnecessarily complex and in exible designs which in turn lead to a huge amount of e ort for enhancements and main...
ROBOCUP
1999
Springer
14 years 28 days ago
1999
Springer
This paper describes an Autonomous Mobile Robot team which plays football, developed by the Group of Automation and Robotics at the Industrial Electronics department of the Univers...
UML
1999
Springer
14 years 28 days ago
1999
Springer
Abstract. The current UML semantics documentation has made a signi cant step towards providing a precise description of the UML. However, at present the semantic model it proposes ...
SIGCOMM
1998
ACM
14 years 28 days ago
1998
ACM
In recent years, a number of link scheduling algorithms have been proposed that greatly improve upon traditional FIFO scheduling in being able to assure rate and delay bounds for ...