Sciweavers

15660 search results - page 60 / 3132
» The Unbalance of Set Systems
Sort
View
ICDCN
2011
Springer
14 years 3 months ago
Deterministic Dominating Set Construction in Networks with Bounded Degree
This paper considers the problem of calculating dominating sets in networks with bounded degree. In these networks, the maximal degree of any node is bounded by Δ, which is usuall...
Roy Friedman, Alex Kogan
ISAAC
2009
Springer
142views Algorithms» more  ISAAC 2009»
15 years 6 months ago
Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement
Abstract. Set agreement is a fundamental problem in distributed computing in which processes collectively choose a small subset of values from a larger set of proposals. The imposs...
Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Core...
APN
2011
Springer
14 years 3 months ago
On the Origin of Events: Branching Cells as Stubborn Sets
In prime event structures with binary conflicts (pes-bc)3 a branching cell [1] is a subset of events closed under downward causality and immediate conflict relations. This means ...
Henri Hansen, Xu Wang
CCA
2009
Springer
15 years 6 months ago
Random Iteration Algorithm for Graph-Directed Sets
Abstract. A random iteration algorithm for graph-directed sets is defined and discussed. Similarly to the Barnsley-Elton’s theorem, it is shown that almost all sequences obtaine...
Yoshiki Tsujii, Takakazu Mori, Mariko Yasugi, Hide...
FOCI
2007
IEEE
15 years 3 months ago
Type-2 Fuzzy Sets: Geometric Defuzzification and Type-Reduction
This paper presents the geometric defuzzifier for generalised type-2 fuzzy sets. This defuzzifier can be executed in real-time and can therefore be applied to control and other rea...
Simon Coupland