Results 231 to 240 of about 25,195 (291)

Aerodynamic Optimization of Relay Nozzle Using a Chebyshev KAN Surrogate Model Integration and an Improved Multi-Objective Red-Billed Blue Magpie Optimizer. [PDF]

Biomimetics (Basel)
Shen M, Zhang Z, Qin G, Zhou D, Du L, Yu L.   +5 more
europepmc   +1 more source

Robust and Efficient Dual-Strategy Switch Migration for Failure Recovery in Software-Defined Satellite Networks. [PDF]

Sensors (Basel)
Xu S, Yin Z, Huang M, Xing L.
europepmc   +1 more source

Development of the vector education, communication, and training online resource (VECTOR) library: a vector-borne disease education database. [PDF]

BMC Public Health
Lysaker DT, Struckhoff ED, Chakravarti I, Bognanni OJ, Machtinger ET.   +4 more
europepmc   +1 more source

Accelerated Discovery of 3D Printing Calcium Sulphoaluminate Cement Composites Using Data-Driven Multi-Objective Optimization. [PDF]

Materials (Basel)
Liu Y, Fan Q, Zheng Y, Meng D, Zhao Z, Wang S, Gu L.   +6 more
europepmc   +1 more source

In Silico Isomerization Produces Apt Negative Data for VHTS Validation. [PDF]

J Chem Inf Model
Ivanov SM.
europepmc   +1 more source

Migration dynamic of fall armyworm Spodoptera frugiperda (J. E. Smith) between China's southern Yunnan and the Indo-China Peninsula. [PDF]

Pest Manag Sci
Zhao S, Liu D, Yang X, Chen S, Cang X, Fang Y, Lv C, Wu K.   +7 more
europepmc   +1 more source

IDR searcher: a search engine solution for public image resource

Mohamed K, Moore W, Lindner D, Moore J, Swedlow JR, Walczysko P, Wong F, Burel J.   +7 more
europepmc   +1 more source

Sorting and Searching in Faulty Memories

Algorithmica, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Irene FINOCCHI, Giuseppe Francesco Italiano   +1 more
exaly   +6 more sources

Some of the next articles are maybe not open access.

Related searches:

Sorting, Approximate Sorting, and Searching in Rounds

SIAM Journal on Discrete Mathematics, 1988
The worst case number of comparisons needed for sorting or selecting in rounds is considered. The following results are obtained. (a) For every fixed \(k\geq 2\), \(\Omega (n^{1+1/k}(\log n)^{1/k})\) comparisons are required to sort n elements in k rounds. \((O(n^{1+1/k}\log n)\) are known to be sufficient.) This improves the previously known bounds by
Yossi Azar
exaly   +4 more sources

Sorting and Searching in Multisets

SIAM Journal on Computing, 1976
In this paper the problem of sorting multisets is considered. An information theoretic lower bound on the number of three branch comparisons is obtained, and it is shown that this bound is asymptotically attainable. It is shown that the multiplicities of a set can only be obtained by comparisons if the total order is discovered in the process.
J. Ian Munro, Philip M. Spira
exaly   +2 more sources