Results 261 to 270 of about 5,277,522 (305)
Development of conditional cores via supersaturated designs for genetic diversity-based prediction models. [PDF]
Plant GenomeZhou X, Garcia-Abadillo J, Jarquin D.
europepmc +1 more source
Physics informed neural network surrogate modeling and global sensitivity analysis of magnetized nanofluid flow over a porous cylinder for solar thermal energy applications. [PDF]
Discov NanoHussain M, Alhushaybari A.
europepmc +1 more source
Simulation-informed kernel-based regression models for predicting temperature distribution in microwave hyperthermia. [PDF]
Sci RepAlazwari MA, Abu-Hamdeh NH, Almitani KH.
europepmc +1 more source
Advances in linear epitope-based subunit vaccines powered by artificial intelligence: current status and challenges. [PDF]
Front ImmunolQuan J +5 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Journal of Algorithms, 1990
Summary: We investigate the problem of linear broadcast, which is performed in a network in which messages follow linear routes. This is a characteristic of many high-speed networks, in which a special hardware is used for switching. Following, extending, and improving the recent work of \textit{C. T. Chou} and \textit{I. S.
Sara Bitan, Shmuel Zaks
openaire +2 more sources
Summary: We investigate the problem of linear broadcast, which is performed in a network in which messages follow linear routes. This is a characteristic of many high-speed networks, in which a special hardware is used for switching. Following, extending, and improving the recent work of \textit{C. T. Chou} and \textit{I. S.
Sara Bitan, Shmuel Zaks
openaire +2 more sources
On the Optimality of Linear Merge
SIAM Journal on Computing, 1980Let $M(m,n)$ be the minimum number of pairwise comparisons which will always suffice to merge two linearly ordered lists of lengths m and n. We prove that $M(m,m + d) = 2m + d - 1$ whenever $m \geqq 2d - 2$. This generalizes earlier results of Graham and Karp $(d = 1)$, Hwang and Lin $(d = 2,3)$, Knuth $(d = 4)$, and shows that the standard linear ...
Paul K. Stockmeyer, F. Frances Yao
openaire +2 more sources
SIAM Journal on Applied Mathematics, 1973
Consider a set of n pins and $n( n - 1 )/2$ specified numbers of wire connections between all pairs of the n pins There are also n holes all in a line with adjacent holes at unit distances apart. The problem is to put the n pins into the n holes such that the total wire length is a minimum.
Adolphson, D., Hu, T. C.
openaire +2 more sources
Consider a set of n pins and $n( n - 1 )/2$ specified numbers of wire connections between all pairs of the n pins There are also n holes all in a line with adjacent holes at unit distances apart. The problem is to put the n pins into the n holes such that the total wire length is a minimum.
Adolphson, D., Hu, T. C.
openaire +2 more sources
On the optimality of linear schedules
Journal of VLSI signal processing systems for signal, image and video technology, 1989An algorithm can be modeled as a set of indexed computations, and a schedule is a mapping of the algorithm index space into time.Linear schedules are a special class of schedules that are described by a linear mapping and are commonly used in many systolic algorithms.Free schedules cause computations of an algorithm to execute as soon as their operands
Weijia Shang, José A. B. Fortes
openaire +1 more source