Results 111 to 120 of about 1,590,381 (357)
Global optimization using random embeddings [PDF]
We propose a random-subspace algorithmic framework for global optimization of Lipschitz-continuous objectives, and analyse its convergence using novel tools from conic integral geometry. X-REGO randomly projects, in a sequential or simultaneous manner, the high-dimensional original problem into low-dimensional subproblems that can then be solved with ...
arxiv
In this paper, we present a novel methodology to generate complex functions using two-dimensional fuzzy sets as weights for combining classical benchmark functions.
Eddy Mesa+2 more
doaj
An Improved Artificial Bee Colony Algorithm With Fitness-Based Information
Artificial bee colony (ABC) algorithm is widely known for its distinguished exploration ability. However, its exploitation ability is relatively poor.
Wan-Li Xiang+4 more
doaj +1 more source
GLOBAL OPTIMIZATION METHODS [PDF]
Training a neural network is a difficult optimization problem because of numerous local minimums. Many global search algorithms have been used to train neural networks. However, local search algorithms are more efficient with computational resources, and
Brorsen, B. Wade, Hamm, Lonnie
core +1 more source
Robust analysis and global optimization [PDF]
In this paper, the properties of robust sets and robust functions are studied. Also, we study minimization of a robust function over a robust set and extend the optimality conditions of [3] and the algorithm of [4,5] to our case. The algorithm is shown to be effective.
openaire +2 more sources
Targeted metabolomics reveals novel diagnostic biomarkers for colorectal cancer
This study employed targeted metabolomic profiling to identify 302 distinct metabolites present in platelet‐rich plasma (PRP), revealing aberrant metabolic profiles amongst individuals diagnosed with colorectal cancer (CRC). Compared to carcinoembryonic antigen (CEA) and cancer antigen 19‐9 (CA199), our metabolite panel showed improved sensitivity ...
Zuojian Hu+7 more
wiley +1 more source
Hole Filling for View Synthesis Using Depth Guided Global Optimization
View synthesis is an effective way to generate multi-view contents from a limited number of views, and can be utilized for 2-D-to-3-D video conversion, multi-view video compression, and virtual reality. In the view synthesis techniques, depth-image-based
Guibo Luo, Yuesheng Zhu
doaj +1 more source
Cell‐free DNA aneuploidy score as a dynamic early response marker in prostate cancer
mFast‐SeqS‐based genome‐wide aneuploidy scores are concordant with aneuploidy scores obtained by whole genome sequencing from tumor tissue and can predict response to ARSI treatment at baseline and, at an early time point, to ARSI and taxanes. This assay can be easily performed at low cost and requires little input of cfDNA. Cell‐free circulating tumor
Khrystany T. Isebia+17 more
wiley +1 more source
Clinical significance of stratifying prostate cancer patients through specific circulating genes
We tested a specific panel of genes representative of luminal, neuroendocrine and stem‐like cells in the blood of prostate cancer patients, showing predictive value from diagnosis to late stages of disease. This approach allows monitoring of treatment responses and outcomes at specific time points in trajectories.
Seta Derderian+12 more
wiley +1 more source
CACO : Competitive Ant Colony Optimization, A Nature-Inspired Metaheuristic For Large-Scale Global Optimization [PDF]
Large-scale problems are nonlinear problems that need metaheuristics, or global optimization algorithms. This paper reviews nature-inspired metaheuristics, then it introduces a framework named Competitive Ant Colony Optimization inspired by the chemical communications among insects.
arxiv