Results 61 to 70 of about 681,060 (327)
Targeted modulation of IGFL2‐AS1 reveals its translational potential in cervical adenocarcinoma
Cervical adenocarcinoma patients face worse outcomes than squamous cell carcinoma counterparts despite similar treatment. The identification of IGFL2‐AS1's differential expression provides a molecular basis for distinguishing these histotypes, paving the way for personalized therapies and improved survival in vulnerable populations globally.
Ricardo Cesar Cintra +6 more
wiley +1 more source
Improving Search Accuracy in Large-Scale Biased Multiobjective Optimization Through Local Search
Biased multiobjective optimization problems pose a challenge for evolutionary algorithms in obtaining high-accuracy solutions, and as the number of decision variables increases, this challenge becomes increasingly difficult to overcome.
Feng Yin, Bin Cao
doaj +1 more source
TDSD: A New Evolutionary Algorithm Based on Triple Distinct Search Dynamics
Spherical evolution is a recently proposed nature-inspired meta-heuristic algorithm which is proven to have nontrivial efficiency and effectiveness in solving complex optimization problems.
Xiaosi Li +5 more
doaj +1 more source
Optimizing One Million Variable NK Landscapes by Hybridizing Deterministic Recombination and Local Search [PDF]
In gray-box optimization, the search algorithms have access to the variable interaction graph (VIG) of the optimization problem. For Mk Landscapes (and NK Landscapes) we can use the VIG to identify an improving solution in the Hamming neighborhood in ...
Darrell, Whitley +3 more
core
Combinatorial Optimization by Iterative Partial Transcription
A procedure is presented which considerably improves the performance of local search based heuristic algorithms for combinatorial optimization problems.
A. Möbius +4 more
core +2 more sources
Effectiveness of Local Search for Geometric Optimization
What is the effectiveness of local search algorithms for geometric problems in the plane? We prove that local search with neighborhoods of magnitude 1/epsilon^c is an approximation scheme for the following problems in the Euclidean plane: TSP with random inputs, Steiner tree with random inputs, uniform facility location (with worst case inputs), and ...
Cohen-Addad, Vincent, Mathieu, Claire
openaire +4 more sources
Local Optimization Method with Global Multidimensional Search
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Adil M. Bagirov +2 more
openaire +2 more sources
Pancreatic sensory neurons innervating healthy and PDAC tissue were retrogradely labeled and profiled by single‐cell RNA sequencing. Tumor‐associated innervation showed a dominant neurofilament‐positive subtype, altered mitochondrial gene signatures, and reduced non‐peptidergic neurons.
Elena Genova +14 more
wiley +1 more source
A Self-Adaptive Heuristic Algorithm for Combinatorial Optimization Problems [PDF]
This paper introduces a new self-tuning mechanism to the local search heuristic for solving of combinatorial optimization problems. Parameter tuning of heuristics makes them difficult to apply, as parameter tuning itself is an optimization problem.
Cigdem Alabas-Uslu, Berna Dengiz
doaj +1 more source
Time‐resolved X‐ray solution scattering captures how proteins change shape in real time under near‐native conditions. This article presents a practical workflow for light‐triggered TR‐XSS experiments, from data collection to structural refinement. Using a calcium‐transporting membrane protein as an example, the approach can be broadly applied to study ...
Fatemeh Sabzian‐Molaei +3 more
wiley +1 more source

