In distributed scenarios the robustness of a reputation mechanism depends on the data available for computation. Especially in ad-hoc networks the amount of available data is rest...
The application of hardware-parameterized models to distributed systems can result in omission of key bottlenecks such as the full cost of inter-node communication in a shared mem...
Recent research in frequent pattern mining (FPM) has shifted from obtaining the complete set of frequent patterns to generating only a representative (summary) subset of frequent ...
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
Distributed-memory programs are often written using a global address space: any process can name any memory location on any processor. Some languages completely hide the distincti...