Results 171 to 180 of about 1,709,161 (224)
Adversarial path planning for optimal CCTV surveillance: a case study on nuclear facility security optimization. [PDF]
Sci RepSalman AE, Shaaban N, Zidan WI, Saad MH.
europepmc +1 more source
Multivariate Optimization of Ultrasound-Assisted Extraction of Phenolic Compounds from Apples. [PDF]
MoleculesMelini F, Fasano S, Melini V.
europepmc +1 more source
Linear Causal Discovery with Interventional Constraints. [PDF]
Mach LearnGuo Z, Dong F.
europepmc +1 more source
Impact of linear programming-based optimization of pediatric hospital location and quantity on patient travel time in Germany. [PDF]
BMC Health Serv ResLesniowski D, Terliesner N.
europepmc +1 more source
Regularized Tensor Quantile Regression With Applications to Neuroimaging Data Analysis. [PDF]
Stat MedPietrosanu M +4 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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
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 +1 more source
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 +1 more source
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