Results 21 to 30 of about 182,395 (164)
Probability-boosting technique for combinatorial optimization [PDF]
PeerJ Computer ScienceIn many combinatorial optimization problems we want a particular set of k out of n items with some certain properties (or constraints). These properties may involve the k items.
Sanpawat Kantabutra
doaj +2 more sources
Reduction of Phase Shifters in Planar Phased Arrays Using Novel Random Subarray Techniques
Applied SciencesReducing the number of phase shifters by grouping antenna elements into subarrays has been extensively studied for decades. The number of phase shifters directly affects the cost, complexity, and power consumption of the system.
Juan L. Valle +4 more
doaj +1 more source
Fibonacci Tessellation for Optimizing Planar Phased Arrays in Satellite Communications
TechnologiesThis article presents a novel strategy for the design of planar phased arrays using Fibonacci-based partitioning combined with a random multi-objective search.
Juan L. Valle +5 more
doaj +1 more source
On Application of the Ray-Shooting Method for LQR via Static-Output-Feedback
Algorithms, 2018 In this article we suggest a randomized algorithm for the LQR (Linear Quadratic Regulator) optimal-control problem via static-output-feedback. The suggested algorithm is based on the recently introduced randomized optimization method called the Ray ...
Yossi Peretz
doaj +1 more source
Cryptography and Algorithmic Randomness [PDF]
Theory of Computing Systems, 2014 34 pages, LaTeX2e, no ...
Tadaki, Kohtaro, Doi, Norihisa
openaire +2 more sources
An Accurate and Impartial Expert Assignment Method for Scientific Project Review
Journal of Data and Information Science, 2017 This paper proposes an expert assignment method for scientific project review that considers both accuracy and impartiality. As impartial and accurate peer review is extremely important to ensure the quality and feasibility of scientific projects ...
Yue Mingliang, Tian Kailin, Ma Tingcan
doaj +1 more source
Random forest missing data algorithms [PDF]
Statistical Analysis and Data Mining: The ASA Data Science Journal, 2017 Random forest (RF) missing data algorithms are an attractive approach for imputing missing data. They have the desirable properties of being able to handle mixed types of missing data, they are adaptive to interactions and nonlinearity, and they have the potential to scale to big data settings.
Tang, Fei, Ishwaran, Hemant
openaire +4 more sources
Balance algorithm for cluster randomized trials
BMC Medical Research Methodology, 2008 Background Within cluster randomized trials no algorithms exist to generate a full enumeration of a block randomization, balancing for covariates across treatment arms.
Hood Kerenza, Carter Ben R
doaj +1 more source
Applied Sciences, 2021 The inversion of potential field data has widely utilized the generalized cross-validation (GCV) and the unbiased predictive risk estimator (UPRE) methods to determine the regularization parameter.
Yuan Fang +3 more
doaj +1 more source
COARSE REDUCIBILITY AND ALGORITHMIC RANDOMNESS [PDF]
The Journal of Symbolic Logic, 2016 AbstractA coarse description of a set A ⊆ ω is a set D ⊆ ω such that the symmetric difference of A and D has asymptotic density 0. We study the extent to which noncomputable information can be effectively recovered from all coarse descriptions of a given set A, especially when A is effectively random in some sense.
Hirschfeldt, Denis R. +3 more
openaire +2 more sources