1074 search results - page 141 / 215 » An ASM-Characterization of a Class of Distributed Algorithms |
SEMWEB
2005
Springer
15 years 3 months ago
2005
Springer
In many practical applications, ontologies tend to be very large and complicated. In order for users to quickly understand and analyze large-scale ontologies, in this paper we prop...
SIGMETRICS
2004
ACM
15 years 3 months ago
2004
ACM
A large variety of communication systems, including telephone and data networks, can be represented by so-called Whittle networks. The stationary distribution of these networks is...
CONCUR
2004
Springer
15 years 3 months ago
2004
Springer
In this paper, we study model checking of timed automata (TAs), and more precisely we aim at finding efficient model checking for subclasses of TAs. For this, we consider model ch...
COOPIS
1999
IEEE
15 years 2 months ago
1999
IEEE
There is currently great interest in building information mediators that can integrate informationfrom multipledata sources such as databases or Web sources. The query response ti...
EDBTW
2010
Springer
15 years 4 months ago
2010
Springer
We investigate the complexity of performing updates on probabilistic XML data for various classes of probabilistic XML documents of different succinctness. We consider two elemen...