Sciweavers

1433 search results - page 42 / 287
» An approach to detecting failures automatically
Sort
View
PODC
1998
ACM
15 years 10 months ago
Probabilistic Byzantine Quorum Systems
ÐIn this paper, we explore techniques to detect Byzantine server failures in asynchronous replicated data services. Our goal is to detect arbitrary failures of data servers in a s...
Dahlia Malkhi, Michael K. Reiter, Avishai Wool, Re...
RTAS
1997
IEEE
15 years 9 months ago
Efficient Run-Time Monitoring of Timing Constraints
A real-time system operates under timing constraints which it may be unable to meet under some circumstances. The criticality of a timing constraint determines how a system is to ...
Aloysius K. Mok, Guangtian Liu
IAT
2009
IEEE
16 years 28 days ago
Group Recommendation with Automatic Identification of Users Communities
—Recommender systems usually propose items to single users. However, in some domains like Mobile IPTV or Satellite Systems it might be impossible to generate a program schedule f...
Ludovico Boratto, Salvatore Carta, Alessandro Ches...
FUIN
2007
130views more  FUIN 2007»
15 years 6 months ago
A Logic-Based Approach to Finding Explanations for Discrepancies in Optimistic Plan Execution
Abstract. Consider an agent executing a plan with nondeterministic actions, in a dynamic environment, which might fail. Suppose that she is given a description of this action domai...
Thomas Eiter, Esra Erdem, Wolfgang Faber, Já...
BMCBI
2005
136views more  BMCBI 2005»
15 years 6 months ago
Automatic detection of false annotations via binary property clustering
Background: Computational protein annotation methods occasionally introduce errors. Falsepositive (FP) errors are annotations that are mistakenly associated with a protein. Such f...
Noam Kaplan, Michal Linial