Sciweavers

PODC
2012
ACM
11 years 7 months ago
Asynchronous failure detectors
Failure detectors — oracles that provide information about process crashes — are an important ion for crash tolerance in distributed systems. Although current failure-detector...
Alejandro Cornejo, Nancy A. Lynch, Srikanth Sastry
SIGECOM
2008
ACM
81views ECommerce» more  SIGECOM 2008»
13 years 4 months ago
Self-financed wagering mechanisms for forecasting
We examine a class of wagering mechanisms designed to elicit truthful predictions from a group of people without requiring any outside subsidy. We propose a number of desirable pr...
Nicolas S. Lambert, John Langford, Jennifer Wortma...
ARGMAS
2008
Springer
13 years 6 months ago
Command Dialogues
Verification that agent communication protocols have desirable properties or do not have undesirable properties is an important issue in agent systems where agents intend to commu...
Katie Atkinson, Roderic A. Girle, Peter McBurney, ...
ICLP
2004
Springer
13 years 10 months ago
Non-viability Deductions in Arc-Consistency Computation
Arc-Consistency (AC) techniques have been used extensively in the study of Constraint Satisfaction Problems (CSP). These techniques are used to simplify the CSP before or during th...
Camilo Rueda, Frank D. Valencia
ARCS
2004
Springer
13 years 10 months ago
Finite-State Modeling, Analysis and Testing of System Vulnerabilities
: Man-machine systems have several desirable properties, as to user friendliness, reliability, safety, security or other global system attributes. The potential for the lack, or br...
Fevzi Belli, Christof J. Budnik, Nimal Nissanke
ICC
2009
IEEE
136views Communications» more  ICC 2009»
13 years 11 months ago
Fast Connected Dominating Set Construction in Mobile Ad Hoc Networks
—The connected dominating set (CDS) has been commonly used for routing and broadcast in mobile ad hoc networks (MANETs). Considering the applications of MANETs, it is generally p...
Kazuya Sakai, Min-Te Sun, Wei-Shinn Ku
EDBT
2004
ACM
142views Database» more  EDBT 2004»
14 years 4 months ago
Iterative Incremental Clustering of Time Series
We present a novel anytime version of partitional clustering algorithm, such as k-Means and EM, for time series. The algorithm works by leveraging off the multi-resolution property...
Jessica Lin, Michail Vlachos, Eamonn J. Keogh, Dim...
PODC
2009
ACM
14 years 5 months ago
Correctness of gossip-based membership under message loss
Due to their simplicity and effectiveness, gossip-based membership protocols have become the method of choice for maintaining partial membership in large P2P systems. A variety of...
Maxim Gurevich, Idit Keidar