13457 search results - page 67 / 2692 » Can we elect if we cannot compare |
CCGRID
2010
IEEE
13 years 8 months ago
2010
IEEE
With the increasing functionality and complexity of distributed systems, resource failures are inevitable. While numerous models and algorithms for dealing with failures exist, th...
CSR
2008
Springer
13 years 9 months ago
2008
Springer
The universal cover TG of a connected graph G is the unique (possible infinite) tree covering G, i.e., that allows a locally bijective homomorphism from TG to G. Universal covers h...
BMCBI
2007
13 years 7 months ago
2007
Background: Features of a DNA sequence can be found by compressing the sequence under a suitable model; good compression implies low information content. Good DNA compression mode...
ICTAI
2002
IEEE
14 years 18 days ago
2002
IEEE
In this paper, we propose new dominance relations that can speed up significantly the solution process of nonlinear constrained dynamic optimization problems in discrete time and...
ICDM
2002
IEEE
14 years 19 days ago
2002
IEEE
We have proposed replicator neural networks (RNNs) as an outlier detecting algorithm [15]. Here we compare RNN for outlier detection with three other methods using both publicly a...