Sciweavers

678 search results - page 121 / 136
» Generalized Percolation Processes Using Pretopology Theory
Sort
View
IDEAS
2009
IEEE
111views Database» more  IDEAS 2009»
14 years 2 months ago
Semantics of a runtime adaptable transaction manager
Database Management Systems (DBMSs) that can be tailored to specific requirements offer the potential to improve reliability and maintainability and simultaneously the ability t...
Florian Irmert, Frank Lauterwald, Christoph P. Neu...
ATAL
2007
Springer
14 years 2 months ago
Letting loose a SPIDER on a network of POMDPs: generating quality guaranteed policies
Distributed Partially Observable Markov Decision Problems (Distributed POMDPs) are a popular approach for modeling multi-agent systems acting in uncertain domains. Given the signi...
Pradeep Varakantham, Janusz Marecki, Yuichi Yabu, ...
CASES
2006
ACM
14 years 1 months ago
Automated compile-time and run-time techniques to increase usable memory in MMU-less embedded systems
Random access memory (RAM) is tightly-constrained in many embedded systems. This is especially true for the least expensive, lowest-power embedded systems, such as sensor network ...
Lan S. Bai, Lei Yang, Robert P. Dick
PODC
2006
ACM
14 years 1 months ago
Self-stabilizing byzantine agreement
Byzantine agreement algorithms typically assume implicit initial state consistency and synchronization among the correct nodes and then operate in coordinated rounds of informatio...
Ariel Daliot, Danny Dolev
PODC
2005
ACM
14 years 1 months ago
Quorum placement in networks to minimize access delays
A quorum system is a family of sets (themselves called quorums), each pair of which intersect. In many distributed algorithms, the basic unit accessed by a client is a quorum of n...
Anupam Gupta, Bruce M. Maggs, Florian Oprea, Micha...