Sciweavers

1581 search results - page 200 / 317
» Domain semantics of possibility computations
Sort
View
FORTE
2004
15 years 2 months ago
Symbolic Diagnosis of Partially Observable Concurrent Systems
Abstract. Monitoring large distributed concurrent systems is a challenging task. In this paper we formulate (model-based) diagnosis by means of hidden state history reconstruction,...
Thomas Chatain, Claude Jard
DSN
2000
IEEE
15 years 5 months ago
Exploiting Non-Determinism for Reliability of Mobile Agent Systems
An important technical hurdle blocking the adoption of mobile agent technology is the lack of reliability. Designing a reliable mobile agent system is especially challenging since...
Ajay Mohindra, Apratim Purakayastha, Prasannaa Tha...
ENTCS
2007
94views more  ENTCS 2007»
15 years 20 days ago
Virtual Organizations in Arigatoni
Arigatoni is a lightweight overlay network that deploys the Global Computing Paradigm over the Internet. Communication for over the behavioral units of the overlay is performed by...
Michel Cosnard, Luigi Liquori, Raphaël Chand
131
Voted
AIMSA
2008
Springer
15 years 7 months ago
Noun Compound Interpretation Using Paraphrasing Verbs: Feasibility Study
Abstract. The paper addresses an important challenge for the automatic processing of English written text: understanding noun compounds’ semantics. Following Downing (1977) [1], ...
Preslav Nakov
ATAL
2010
Springer
15 years 1 months ago
Alternating-time dynamic logic
We propose Alternating-time Dynamic Logic (ADL) as a multi-agent variant of Dynamic Logic in which atomic programs are replaced by coalitions. In ADL, the Dynamic Logic operators ...
Nicolas Troquard, Dirk Walther