Sciweavers

3616 search results - page 16 / 724
» Conditional Memory Ordering
Sort
View
SIGMETRICS
2009
ACM
134views Hardware» more  SIGMETRICS 2009»
15 years 8 months ago
DRAM errors in the wild: a large-scale field study
Errors in dynamic random access memory (DRAM) are a common form of hardware failure in modern compute clusters. Failures are costly both in terms of hardware replacement costs and...
Bianca Schroeder, Eduardo Pinheiro, Wolf-Dietrich ...
104
Voted
CDC
2010
IEEE
122views Control Systems» more  CDC 2010»
14 years 9 months ago
A lower bound for distributed averaging algorithms on the line graph
We derive lower bounds on the convergence speed of a widely used class of distributed averaging algorithms. In particular, we prove that any distributed averaging algorithm whose ...
Alexander Olshevsky, John N. Tsitsiklis
ORDER
2002
107views more  ORDER 2002»
15 years 1 months ago
Order Dimension, Strong Bruhat Order and Lattice Properties for Posets
We determine the order dimension of the strong Bruhat order on finite Coxeter groups of types A, B and H. The order dimension is determined using a generalization of a theorem of D...
Nathan Reading
ARSCOM
2004
86views more  ARSCOM 2004»
15 years 2 months ago
New Conditions for k-ordered Hamiltonian Graphs
We show that in any graph G on n vertices with d(x) + d(y) n for any two nonadjacent vertices x and y, we can fix the order of k vertices on a given cycle and find a hamiltonian c...
Guantao Chen, Ronald J. Gould, Florian Pfender
107
Voted
AML
2005
81views more  AML 2005»
15 years 2 months ago
A logical and algebraic treatment of conditional probability
This paper is devoted to a logical and algebraic treatment of conditional probability. The main ideas are the use of non-standard probabilities and of some kind of standard part f...
Tommaso Flaminio, Franco Montagna