614 search results - page 55 / 123 » Local Computation: Lower and Upper Bounds |
FORMATS
2009
Springer
15 years 1 months ago
2009
Springer
Probabilistic timed automata (PTAs) are used for formal modelling and verification of systems with probabilistic, nondeterministic and real-time behaviour. For non-probabilistic ti...
STACS
2009
Springer
15 years 4 months ago
2009
Springer
We analyze the structure of equilibria and the price of anarchy in the family of network creation games considered extensively in the past few years, which attempt to unify the net...
BROADNETS
2005
IEEE
15 years 3 months ago
2005
IEEE
— Ethernet over SONET (EoS) is a popular approach for interconnecting geographically distant Ethernet segments using a SONET transport infrastructure. It typically uses virtual c...
CAS
2008
14 years 10 months ago
2008
In this paper we first present a novel approach to determine the structural information content (graph entropy) of a network represented by an undirected and connected graph. Such...
100
click to vote
CDC
2010
IEEE
14 years 5 months ago
2010
IEEE
Abstract-- We propose an algorithm for decentralised navigation of multiple independent agents, applicable to Robotics and Air Traffic Control (ATC). We present completely decentra...