3229 search results - page 276 / 646 » The Theory of Timed Automata |
141
Voted
ASPDAC
2006
ACM
16 years 21 days ago
2006
ACM
Abstract— It is important to separate random jitter from deterministic jitter to quantify their contributions to the total jitter. This paper identifies the limitations of the e...
170
click to vote
ISAAC
2005
Springer
16 years 7 days ago
2005
Springer
We characterize the gap between time and space complexity of functions by operators and completeness. First, we introduce a new notion of operators for function complexity classes ...
134
click to vote
MABS
2005
Springer
16 years 6 days ago
2005
Springer
Abstract. Dynamic and resource-constrained environments raise interesting issues for partnership formation and multi-agent systems. In a scenario in which agents interact with each...
165
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
We prove that the union complexity of a set of n constantcomplexity locally fat objects (which can be curved and/or non-convex) in the plane is O(λt+2(n) log n), where t is the m...
207
click to vote
DALT
2009
Springer
15 years 10 months ago
2009
Springer
This paper generalises the theory of agent refinement from [1] to multi-agent systems in the presence of new coordination mechanisms extended with real time. The generalisation is ...