Sciweavers

2702 search results - page 436 / 541
» Practically Applicable Formal Methods
Sort
View
ICTAI
1997
IEEE
13 years 11 months ago
GA-Based Performance Analysis of Network Protocols
This paper tackles the problem of analyzing the correctness and performance of a computer network protocol. Given the complexity of the problem, no currently used technique is abl...
Mario Baldi, Fulvio Corno, Maurizio Rebaudengo, Gi...
ATAL
2008
Springer
13 years 10 months ago
Quantifying over coalitions in epistemic logic
Some natural epistemic properties which may arise in applications can only be expressed in standard epistemic logic by formulae which are exponentially long in the number of agent...
Thomas Ågotnes, Wiebe van der Hoek, Michael ...
CONEXT
2008
ACM
13 years 10 months ago
Maintaining replicas in unstructured P2P systems
Replication is widely used in unstructured peer-to-peer systems to improve search or achieve availability. We identify and solve a subclass of replication problems where each obje...
Christof Leng, Wesley W. Terpstra, Bettina Kemme, ...
IJCAI
2007
13 years 9 months ago
Tractable Temporal Reasoning
Temporal reasoning is widely used within both Computer Science and A.I. However, the underlying complexity of temporal proof in discrete temporal logics has led to the use of simp...
Clare Dixon, Michael Fisher, Boris Konev
AAAI
2006
13 years 9 months ago
SEMAPLAN: Combining Planning with Semantic Matching to Achieve Web Service Composition
Composing existing Web services to deliver new functionality is a difficult problem as it involves resolving semantic, syntactic and structural differences among the interfaces of...
Rama Akkiraju, Biplav Srivastava, Anca-Andreea Iva...