Sciweavers

4934 search results - page 161 / 987
» complexity 2008
Sort
View
TPDS
2008
76views more  TPDS 2008»
15 years 4 months ago
How to Choose a Timing Model
When employing a consensus algorithm for state machine replication, should one optimize for the case that all communication links are usually timely, or for fewer timely links? Do...
Idit Keidar, Alexander Shraer
129
Voted
SOFTWARE
2002
15 years 4 months ago
Facing Fault Management as It Is, Aiming for What You Would Like It to Be
Telecommunication systems are built with extensive redundancy and complexity to ensure robustness and quality of service. Such systems requires complex fault identification and man...
Roy Sterritt
KER
2008
134views more  KER 2008»
15 years 4 months ago
A review of current defeasible reasoning implementations
This article surveys existing practical implementations of both defeasible and argumentationbased reasoning engines and associated literature. We aim to summarise the current stat...
Daniel Bryant, Paul J. Krause
ITIIS
2008
110views more  ITIIS 2008»
15 years 4 months ago
Fast Detection of Distributed Global Scale Network Attack Symptoms and Patterns in High-speed Backbone Networks
Traditional attack detection schemes based on packets or flows have very high computational complexity. And, network based anomaly detection schemes can reduce the complexity, but...
Sun Ho Kim, Byeong-hee Roh
EMNLP
2008
15 years 5 months ago
Understanding the Value of Features for Coreference Resolution
In recent years there has been substantial work on the important problem of coreference resolution, most of which has concentrated on the development of new models and algorithmic...
Eric Bengtson, Dan Roth