Results 41 to 50 of about 1,002,612 (293)
Transforming structures by set interpretations [PDF]
We consider a new kind of interpretation over relational structures: finite sets interpretations. Those interpretations are defined by weak monadic second-order (WMSO) formulas with free set variables.
Thomas Colcombet, Christof Löding
doaj +1 more source
An Energy-Efficient and Fault-Tolerant Convergecast Protocol in Wireless Sensor Networks
The simple graph theory is commonly employed in wireless sensor networks topology control. An inherent problem of small-granularity algorithms is the high computing complexity and large solution space when managing large-scale WSNs. Computed transmission
Ting Yang, ChunJian Kang, Guofang Nan
doaj +1 more source
Method for Developing Combinatorial Generation Algorithms Based on AND/OR Trees and Its Application
In this paper, we study the problem of developing new combinatorial generation algorithms. The main purpose of our research is to derive and improve general methods for developing combinatorial generation algorithms.
Yuriy Shablya+2 more
doaj +1 more source
Scattering of conformal higher spin fields
We develop a formalism for describing the most general notion of tree-level scattering amplitudes in 4d conformal higher spin theory. As conformal higher spin fields obey higher-derivative equations of motion, there are many distinct on-shell external ...
Tim Adamo+2 more
doaj +1 more source
Improvement of ID3 Algorithm Based on Simplified Information Entropy and Coordination Degree
The decision tree algorithm is a core technology in data classification mining, and ID3 (Iterative Dichotomiser 3) algorithm is a famous one, which has achieved good results in the field of classification mining.
Yingying Wang+4 more
doaj +1 more source
BCJ numerators from differential operator of multidimensional residue
In previous works, we devised a differential operator for evaluating typical integrals appearing in the Cachazo–He–Yuan (CHY) forms and in this paper we further streamline this method.
Gang Chen, Tianheng Wang
doaj +1 more source
How unprovable is Rabin's decidability theorem?
We study the strength of set-theoretic axioms needed to prove Rabin's theorem on the decidability of the MSO theory of the infinite binary tree. We first show that the complementation theorem for tree automata, which forms the technical core of typical ...
Beckmann A.+6 more
core +1 more source
This study examines the demographic dynamics of two seabird populations on Tromelin Island, 15 years after the eradication of brown rats. The results indicate that these populations are in good health and are expected to continue growing until breeding sites are saturated in about a century.
Merlène Saunier+6 more
wiley +1 more source
A New Method to Identify Incomplete Frame of Discernment in Evidence Theory
One assumption of Dempster-Shafer evidence theory (D-S theory) is the closed world. However, how to determine whether the frame of discernment is incomplete or not is still an open issue.
Renliang Sun, Yong Deng
doaj +1 more source
Dynamical percolation on general trees
H\"aggstr\"om, Peres, and Steif (1997) have introduced a dynamical version of percolation on a graph $G$. When $G$ is a tree they derived a necessary and sufficient condition for percolation to exist at some time $t$.
A.S. Besicovitch+22 more
core +1 more source