2924 search results - page 477 / 585 » Lower Bounds in Distributed Computing |
138
click to vote
EUC
2004
Springer
15 years 9 months ago
2004
Springer
We propose power-aware on-line task scheduling algorithms for mixed task sets which consist of both periodic and aperiodic tasks. The proposed algorithms utilize the execution beha...
125
click to vote
MMAS
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. In order to construct and deploy massively multiagent systems, we must address one of the fundamental issues of distributed systems, the possibility of partial failures. ...
134
click to vote
LATA
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. This paper contributes to the study of Freely Rewriting Restarting Automata (FRR-automata) and Parallel Communicating Grammar Systems (PCGS) as formalizations of the ling...
128
click to vote
LPAR
2001
Springer
15 years 9 months ago
2001
Springer
Abstract. The calculus of structures is a framework for specifying logical systems, which is similar to the one-sided sequent calculus but more general. We present a system of infe...
138
click to vote
INFOCOM
1992
IEEE
15 years 8 months ago
1992
IEEE
Local area networks have long been established as the basis for distributed systems. Continuity of service and bounded and known message delivery latency are requirements of a num...