Sciweavers

1676 search results - page 302 / 336
» Coordination for Distributed Business Systems
Sort
View
TON
2002
91views more  TON 2002»
14 years 9 months ago
The stable paths problem and interdomain routing
Abstract-Dynamic routing protocols such as RIP and OSPF essentially implement distributed algorithms for solving the Shortest Paths Problem. The Border Gateway Protocol (BGP) is cu...
Timothy Griffin, F. Bruce Shepherd, Gordon T. Wilf...
ICDCN
2009
Springer
15 years 4 months ago
Byzantine-Resilient Convergence in Oblivious Robot Networks
Given a set of robots with arbitrary initial location and no agreement on a global coordinate system, convergence requires that all robots asymptotically approach the exact same, ...
Zohir Bouzid, Maria Gradinariu Potop-Butucaru, S&e...
IEEEPACT
2008
IEEE
15 years 4 months ago
Scalable and reliable communication for hardware transactional memory
In a hardware transactional memory system with lazy versioning and lazy conflict detection, the process of transaction commit can emerge as a bottleneck. This is especially true ...
Seth H. Pugsley, Manu Awasthi, Niti Madan, Naveen ...
PODC
1989
ACM
15 years 1 months ago
Knowledge, Probability, and Adversaries
: What should it mean for an agent to know or believe an assertion is true with probability :99? Di erent papers FH88, FZ88, HMT88] give di erent answers, choosing to use quite di ...
Joseph Y. Halpern, Mark R. Tuttle
EMSOFT
2004
Springer
15 years 3 months ago
Making mechatronic agents resource-aware in order to enable safe dynamic resource allocation
Mechatronic systems are embedded software systems with hard real-time requirements. Predictability is of paramount importance for these systems. Thus, their design has to take the...
Sven Burmester, Matthias Gehrke, Holger Giese, Sim...