Results 1 to 10 of about 5,273,588 (373)
On the extremal connective eccentricity index among trees with maximum degree [PDF]
The connective eccentricity index (CEI) of a graph $G$ is defined as $\xi^{ce}(G)=\sum_{v \in V(G)}\frac{d_G(v)}{\varepsilon_G(v)}$, where $d_G(v)$ is the degree of $v$ and $\varepsilon_G(v)$ is the eccentricity of $v$. In this paper, we characterize the
Fazal Hayat
doaj +1 more source
Tree of Thoughts: Deliberate Problem Solving with Large Language Models [PDF]
Language models are increasingly being deployed for general problem solving across a wide range of tasks, but are still confined to token-level, left-to-right decision-making processes during inference.
Shunyu Yao+6 more
semanticscholar +1 more source
Assessing sense of community at farmers markets
Farmers markets are valuable for reducing food insecurity and delivering healthy food options to populations living with low incomes. However, farmers markets have developed a reputation for being exclusive shopping spaces devoted to affluent, white ...
Jennifer Russomanno+1 more
doaj +1 more source
Interactive Tree Of Life (iTOL) v5: an online tool for phylogenetic tree display and annotation
The Interactive Tree Of Life (https://itol.embl.de) is an online tool for the display, manipulation and annotation of phylogenetic and other trees. It is freely available and open to everyone.
Ivica Letunic, P. Bork
semanticscholar +1 more source
XGBoost: A Scalable Tree Boosting System [PDF]
Tree boosting is a highly effective and widely used machine learning method. In this paper, we describe a scalable end-to-end tree boosting system called XGBoost, which is used widely by data scientists to achieve state-of-the-art results on many machine
Tianqi Chen, Carlos Guestrin
semanticscholar +1 more source
Sensitive protein alignments at tree-of-life scale using DIAMOND
We are at the beginning of a genomic revolution in which all known species are planned to be sequenced. Accessing such data for comparative analyses is crucial in this new age of data-driven biology. Here, we introduce an improved version of DIAMOND that
Benjamin Buchfink+2 more
semanticscholar +1 more source
AUTOMATION OF QURANIC READINGS GATHERING PROCESS
Quran has been the focus of many computer science and computational linguistics researchers. However, little contribution was directed towards Quranic readings. This field focuses on the different ways in which Quranic words can be recited.
Majed AbuSafiya
doaj +1 more source
Construction for trees without domination critical vertices
Denote by γ(G) the domination number of graph G. A vertex v of a graph G is called fixed if v belongs to every minimum dominating set of G, and bad if v does not belong to any minimum dominating set of G. A vertex v of G is called critical if γ(G−v)
Ying Wang, Fan Wang, Weisheng Zhao
doaj +1 more source
Chromatic number of super vertex local antimagic total labelings of graphs
Let G(V,E) be a simple graph and f be a bijection f : V ∪ E → {1, 2, …, |V|+|E|} where f(V)={1, 2, …, |V|}. For a vertex x ∈ V, define its weight w(x) as the sum of labels of all edges incident with x and the vertex label itself. Then f is called a super
Fawwaz F. Hadiputra+4 more
doaj +1 more source
The Image of a Tree in F.M. Dostoyevsky's Novel "The Idiot" [PDF]
The article is devoted to the analysis of the image of a tree in Dostoevsky’s novel “The Idiot”. The author reflects on the evolution of this image from an artistic detail in the description of the Pavlovsk Park to the philosophical symbol of the Golden ...
Olga N. Smyslova
doaj +1 more source