Sciweavers

2517 search results - page 68 / 504
» Specifying Weak Sets
Sort
View
AAAI
2008
15 years 2 months ago
Non-monotonic Temporal Logics that Facilitate Elaboration Tolerant Revision of Goals
Temporal logics are widely used in specifying goals of agents. We noticed that when directing agents, humans often revise their requirements for the agent, especially as they gath...
Chitta Baral, Jicheng Zhao
HOTDEP
2008
113views Hardware» more  HOTDEP 2008»
15 years 2 months ago
Consistability: Describing Usually Consistent Systems
Current weak consistency semantics provide worst-case guarantees to clients. These guarantees fail to adequately describe systems that provide varying levels of consistency in the...
Amitanand S. Aiyer, Eric Anderson, Xiaozhou Li, Me...
EMSOFT
2008
Springer
15 years 1 months ago
Disassembling real-time fault-tolerant programs
We focus on decomposition of hard-masking real-time faulttolerant programs (where safety, timing constraints, and liveness are preserved in the presence of faults) that are design...
Borzoo Bonakdarpour, Sandeep S. Kulkarni, Anish Ar...
61
Voted
AAAI
2008
15 years 2 months ago
On the Enactability of Business Protocols
Protocols specifying business interactions among autonomous parties enable reuse and promote interoperability. A protocol is specified from a global viewpoint, but enacted in a di...
Nirmit Desai, Munindar P. Singh
TMC
2008
125views more  TMC 2008»
14 years 11 months ago
Distributed Algorithm for Efficient Construction and Maintenance of Connected k-Hop Dominating Sets in Mobile Ad Hoc Networks
A k-hop dominating set is a subset of nodes such that each node not in the set can be reached within k hops from at least one node in the set. A connected k-hop dominating set can ...
Hong-Yen Yang, Chia-Hung Lin, Ming-Jer Tsai