Sciweavers

163 search results - page 9 / 33
» Distributed Repair of Nondiagnosability
Sort
View
PPSN
2010
Springer
13 years 5 months ago
More Effective Crossover Operators for the All-Pairs Shortest Path Problem
The all-pairs shortest path problem is the first non-artificial problem for which it was shown that adding crossover can significantly speed up a mutation-only evolutionary algorit...
Benjamin Doerr, Daniel Johannsen, Timo Kötzin...
ICSE
2003
IEEE-ACM
14 years 7 months ago
Understanding and Predicting Effort in Software Projects
We set out to answer a question we were asked by software project management: how much effort remains to be spent on a specific software project and how will that effort be distri...
Audris Mockus, David M. Weiss, Ping Zhang
ECSA
2011
Springer
12 years 7 months ago
Architecture-Based Run-Time Fault Diagnosis
Abstract. An important step in achieving robustness to run-time faults is the ability to detect and repair problems when they arise in a running system. Effective fault detection a...
Paulo Casanova, Bradley R. Schmerl, David Garlan, ...
FLAIRS
2004
13 years 9 months ago
Dynamic Agent-Ordering and Nogood-Repairing in Distributed Constraint Satisfaction Problems
The distributed constraint satisfaction problem (CSP) is a general formalization used to represent problems in distributed multi-agent systems. To deal with realistic problems, mu...
Lingzhong Zhou, John Thornton, Abdul Sattar
ICDCS
2005
IEEE
14 years 1 months ago
On the Impact of Replica Placement to the Reliability of Distributed Brick Storage Systems
Data reliability of distributed brick storage systems critically depends on the replica placement policy, and the two governing forces are repair speed and sensitivity to multiple...
Qiao Lian, Wei Chen, Zheng Zhang