1404 search results - page 91 / 281 » Complexity of admissible rules |
EEE
2005
IEEE
14 years 2 months ago
2005
IEEE
As the IT industry is becoming more and more interested in service oriented business models and upcoming technologies like Web Services or Grid Computing, the need for automated c...
CSL
2005
Springer
14 years 2 months ago
2005
Springer
Recent work establishes a direct link between the complexity of a linear logic proof in terms of the exchange rule and the topological complexity of its corresponding proof net, ex...
ASC
2008
13 years 9 months ago
2008
This paper presents a methodology for automatically generating online scheduling strategies for a complex objective defined by a machine provider. To this end, we assume independe...
LATA
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. We consider policies that are described by regular expressions, finite automata, or formulae of linear temporal logic (LTL). Such policies are assumed to describe situat...
SIES
2009
IEEE
14 years 3 months ago
2009
IEEE
—We introduce variable-bandwidth servers (VBS) for scheduling and executing processes under programmable temporal isolation. A VBS is an extension of a constant-bandwidth server ...