Results 271 to 280 of about 5,399,796 (309)
Some of the next articles are maybe not open access.
Israel Journal of Mathematics, 1999
Let \(A\) be a computably enumerable set, and \(L(A)\) be the lattice of its supersets under the inclusion relation. It was proved earlier that for many sets \(A\), the filters \(L(A)\) are isomorphic. For example, for all low \(A\), by a result of R.
Cholak, Peter A., Nies, André
openaire +2 more sources
Let \(A\) be a computably enumerable set, and \(L(A)\) be the lattice of its supersets under the inclusion relation. It was proved earlier that for many sets \(A\), the filters \(L(A)\) are isomorphic. For example, for all low \(A\), by a result of R.
Cholak, Peter A., Nies, André
openaire +2 more sources
Journal of Symbolic Logic, 1994
In analogy to the definition of the halting problem K, an r.e. set A is called a diagonal iff there is a computable numbering ψ of the class of all partial recursive functions such that A = {i ∈ ω: ψi(i)↓} (in that case we say that A is the diagonal of ψ). This notion has been introduced in [10]. It captures all r.e.
Herrmann, E., Kummer, Martin
openaire +1 more source
In analogy to the definition of the halting problem K, an r.e. set A is called a diagonal iff there is a computable numbering ψ of the class of all partial recursive functions such that A = {i ∈ ω: ψi(i)↓} (in that case we say that A is the diagonal of ψ). This notion has been introduced in [10]. It captures all r.e.
Herrmann, E., Kummer, Martin
openaire +1 more source
Maximizing the Lifetime of Dominating Sets
19th IEEE International Parallel and Distributed Processing Symposium, 2005We investigate the problem of maximizing the lifetime of wireless ad hoc and sensor networks. Being battery powered, nodes in such networks have to perform their intended task under rigid energy restrictions that forces the designers to impose a judicious power management and scheduling. For the purpose of saving energy, dominating set based clustering
Thomas Moscibroda, Roger Wattenhofer
openaire +1 more source
Homogeneity of maximal antipodal sets
Osaka Journal of Mathematics, 2022The author studies the geometry of the antipodal sets in a compact Riemannian symmetric space \(M\). Two points \(p,q\) in \(M\) are said to be antipodal if \(s_p(q)=q\), where \(s_p\) is the geodesic symmetry at \(p\), and a set \(S\) in \(M\) is said to be antipodal if any two points in \(S\) are antipodal.
openaire +2 more sources
2014 IEEE 28th International Parallel and Distributed Processing Symposium, 2014
Finding a maximal independent set (MIS) is a classic problem in graph theory that has been widely studied in the context of distributed algorithms. Standard distributed solutions to the MIS problem focus on time complexity. In this paper, we also consider fairness.
Jeremy T. Fineman +3 more
openaire +2 more sources
Finding a maximal independent set (MIS) is a classic problem in graph theory that has been widely studied in the context of distributed algorithms. Standard distributed solutions to the MIS problem focus on time complexity. In this paper, we also consider fairness.
Jeremy T. Fineman +3 more
openaire +2 more sources
Maximal Operators and Cantor Sets
Canadian Mathematical Bulletin, 2000AbstractWe consider maximal operators in the plane, defined by Cantor sets of directions, and show such operators are not bounded on L2 if the Cantor set has positive Hausdorff dimension.
openaire +2 more sources
The Ramanujan Journal, 1998
Eine Menge \(A\subseteq \mathbb{N}_0\) heißt Sidon-Menge, wenn alle Summen \(a+a'\) für alle \(a,a'\in A\) \((a\leq a')\) verschieden sind. Eine Sidon-Menge \(A\subset [1,N]\) heißt maximal für \(N\), wenn es keine Sidon-Menge \(A'\) gibt mit \(A\subset A'\subset [1,N]\) \((A'\neq A)\). Auf Grund einer Frage von \textit{P. Erdős, A.
openaire +2 more sources
Eine Menge \(A\subseteq \mathbb{N}_0\) heißt Sidon-Menge, wenn alle Summen \(a+a'\) für alle \(a,a'\in A\) \((a\leq a')\) verschieden sind. Eine Sidon-Menge \(A\subset [1,N]\) heißt maximal für \(N\), wenn es keine Sidon-Menge \(A'\) gibt mit \(A\subset A'\subset [1,N]\) \((A'\neq A)\). Auf Grund einer Frage von \textit{P. Erdős, A.
openaire +2 more sources
Parallel Algorithms for Maximal Acyclic Sets
Algorithmica, 1997zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhi-Zhong Chen, Xin He 0005
openaire +3 more sources
Maximal Balls of Linearly Separable Sets
International Journal of Computational Geometry & Applications, 1994Maximal balls (and the associated maximal spheres) between sets arise naturally in several areas of computational geometry such as the Voronoi diagram and the symmetric axis transform. We give necessary and sufficient conditions for the existence and uniqueness of maximal spheres to pass through specified points in a linear separator between sets in ...
Vijay Srinivasan, Lee R. Nackman
openaire +2 more sources
Journal of Convex Analysis, 2009
In his recent book From Hahn-Banach to monotonicity (Springer-Verlag, Berlin, 2008), S. Simons has introduced the notion of SSD space to provide an abstract algebraic framework for the study of monotonicity. Graphs of (maximal) monotone operators appear to be (maximally)
openaire +2 more sources
In his recent book From Hahn-Banach to monotonicity (Springer-Verlag, Berlin, 2008), S. Simons has introduced the notion of SSD space to provide an abstract algebraic framework for the study of monotonicity. Graphs of (maximal) monotone operators appear to be (maximally)
openaire +2 more sources