Sciweavers

500 search results - page 14 / 100
» Asynchronous Search with Aggregations
Sort
View
CORR
2010
Springer
180views Education» more  CORR 2010»
13 years 8 months ago
Dependability in Aggregation by Averaging
Abstract. Aggregation is an important building block of modern distributed applications, allowing the determination of meaningful properties (e.g. network size, total storage capac...
Paulo Jesus, Carlos Baquero, Paulo Sérgio A...
MMNS
2007
105views Multimedia» more  MMNS 2007»
13 years 9 months ago
Monitoring Flow Aggregates with Controllable Accuracy
In this paper, we show the feasibility of real-time flow monitoring with controllable accuracy in today’s IP networks. Our approach is based on Netflow and A-GAP. A-GAP is a prot...
Alberto Gonzalez Prieto, Rolf Stadler
DEBS
2009
ACM
13 years 9 months ago
Towards efficient event aggregation in a decentralized publish-subscribe system
Recently, decentralized publish-subscribe (pub-sub) systems have gained popularity as a scalable asynchronous messaging paradigm over wide-area networks. Most existing pub-sub sys...
Jianxia Chen, Lakshmish Ramaswamy, David Lowenthal
ATVA
2009
Springer
172views Hardware» more  ATVA 2009»
14 years 2 months ago
Symbolic CTL Model Checking of Asynchronous Systems Using Constrained Saturation
Abstract. The saturation state-space generation algorithm has demonstrated clear improvements over state-of-the-art symbolic methods for asynchronous systems. This work is motivate...
Yang Zhao, Gianfranco Ciardo
IAT
2007
IEEE
14 years 2 months ago
CompAPO: A Complete Version of the APO Algorithm
Asynchronous Partial Overlay (APO) is a search algorithm that uses cooperative mediation to solve Distributed Constraint Satisfaction Problems (DisCSPs). The algorithm partitions ...
Tal Grinshpoun, Amnon Meisels