Results 41 to 50 of about 352,001 (275)
The height of random binary unlabelled trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 This extended abstract is dedicated to the analysis of the height of non-plane unlabelled rooted binary trees. The height of such a tree chosen uniformly among those of size $n$ is proved to have a limiting theta distribution, both in a central and local
Nicolas Broutin, Philippe Flajolet
doaj +1 more source
Trees with the most subtrees -- an algorithmic approach
, 2012 When considering the number of subtrees of trees, the extremal structures which maximize this number among binary trees and trees with a given maximum degree lead to some interesting facts that correlate to other graphical indices in applications.
Gray, Daniel +3 more
core +1 more source
Advanced Engineering Materials, EarlyView.We develop a data‐driven method to derive the mathematical expressions of the Flory–Huggins interaction parameter χ for the swelling behavior of temperature–responsive hydrogels. Starting from initial assumptions of χ, our workflow combines Bayesian optimization, Flory–Rehner theory, and symbolic regression to generate candidate χ expressions.
Yawen Wang +2 more
wiley +1 more source
Holonomic equations and efficient random generation of binary trees [PDF]
Discrete Mathematics & Theoretical Computer ScienceHolonomic equations are recursive equations which allow computing efficiently numbers of combinatoric objects. Rémy showed that the holonomic equation associated with binary trees yields an efficient linear random generator of binary trees.
Pierre Lescanne
doaj +1 more source
On the enumeration of tanglegrams and tangled chains [PDF]
, 2015 Tanglegrams are a special class of graphs appearing in applications concerning cospeciation and coevolution in biology and computer science. They are formed by identifying the leaves of two rooted binary trees.
Billey, Sara +2 more
core
PASTA‐ELN: Simplifying Research Data Management for Experimental Materials Science
Advanced Engineering Materials, EarlyView.Research data management faces ongoing hurdles as many ELNs remain complex and restrictive. PASTA‐ELN offers an open‐source, cross‐platform solution that prioritizes simplicity, offline access, and user control. Its in tuitive folder structure, modular Python add‐ons, and open formats enable seamless documentation, FAIR data practices, and easy ...
S. Brinckmann, G. Winkens, R. Schwaiger
wiley +1 more source
Arc-Completion of 2-Colored Best Match Graphs to Binary-Explainable Best Match Graphs
Algorithms, 2021 Best match graphs (BMGs) are vertex-colored digraphs that naturally arise in mathematical phylogenetics to formalize the notion of evolutionary closest genes w.r.t. an a priori unknown phylogenetic tree. BMGs are explained by unique least resolved trees.
David Schaller +3 more
doaj +1 more source
Predicting Atomic Charges in MOFs by Topological Charge Equilibration
Advanced Functional Materials, Volume 36, Issue 43, 29 May 2026.An atomic charge prediction method is presented that is able to accurately reproduce ab‐initio‐derived reference charges for a large number of metal–organic frameworks. Based on a topological charge equilibration scheme, static charges that fulfill overall neutrality are quickly generated.
Babak Farhadi Jahromi +2 more
wiley +1 more source
Scalable Task Planning via Large Language Models and Structured World Representations
Advanced Robotics Research, EarlyView.This work efficiently combines graph‐based world representations with the commonsense knowledge in Large Language Models to enhance planning techniques for the large‐scale environments that modern robots will need to face. Planning methods often struggle with computational intractability when solving task‐level problems in large‐scale environments ...
Rodrigo Pérez‐Dattari +4 more
wiley +1 more source
CoRR, 2013 Appears in Proceedings of the Twelfth Conference on Uncertainty in Artificial Intelligence (UAI1996)
openaire +3 more sources