Sciweavers

1422 search results - page 259 / 285
» How to measure a large open-source distributed system
Sort
View
89
Voted
CCS
2010
ACM
14 years 9 months ago
Detecting and characterizing social spam campaigns
Online social networks (OSNs) are popular collaboration and communication tools for millions of users and their friends. Unfortunately, in the wrong hands, they are also effective...
Hongyu Gao, Jun Hu, Christo Wilson, Zhichun Li, Ya...
GRID
2006
Springer
14 years 9 months ago
Resource Allocation in Streaming Environments
This paper considers resource allocation algorithms for processing streams of events on computational grids. For example, financial trading applications are executed on large comp...
Lu Tian, K. Mani Chandy
ATAL
2006
Springer
15 years 1 months ago
Accident or intention: that is the question (in the Noisy Iterated Prisoner's Dilemma)
This paper focuses on the Noisy Iterated Prisoner's Dilemma, a version of the Iterated Prisoner's Dilemma (IPD) in which there is a nonzero probability that a "coop...
Tsz-Chiu Au, Dana S. Nau
AGENTS
2001
Springer
15 years 2 months ago
Matchmaking among minimal agents without a facilitator
Multi-Agent Systems are a promising way of dealing with large complex problems. However, it is not yet clear just how much complexity or pre-existing structure individual agents m...
Elth Ogston, Stamatis Vassiliadis
FMLDO
1999
Springer
137views Database» more  FMLDO 1999»
15 years 1 months ago
Federated Transaction Management with Snapshot Isolation
Federated transaction management (also known as multidatabase transaction management in the literature) is needed to ensure the consistency of data that is distributed across mult...
Ralf Schenkel, Gerhard Weikum, Norbert Weiße...