10 search results - page 1 / 2 » The efficiency of minimum operator for fuzzy automata: A cas... |
LATIN
2010
Springer
13 years 6 months ago
2010
Springer
We study the worst case complexity of regular operations on cofinite languages (i.e., languages whose complement is finite) and provide algorithms to compute efficiently the result...
SRDS
1998
IEEE
13 years 9 months ago
1998
IEEE
We study parallel algorithms for computing the minimum spanning tree of a weighted undirected graph G with n vertices and m edges. We consider an input graph G with m=n p, where p...
FORMATS
2009
Springer
13 years 8 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...
SIGSOFT
2008
ACM
13 years 4 months ago
2008
ACM
If an organization depends on the service quality provided by another organization it often enters into a bilateral service level agreement (SLA), which mitigates outsourcing risk...
SIGMOD
2006
ACM
14 years 5 months ago
2006
ACM
Rapid advancements in positioning systems and wireless communications enable accurate tracking of continuously moving objects. This development poses new challenges to database te...