Results 71 to 80 of about 6,941,251 (285)

Search space pruning and global optimization of multiple gravity assist trajectories with deep space manoeuvres [PDF]

, 2007
This paper deals with the design of optimal multiple gravity assist trajectories with deep space manoeuvres. A pruning method which considers the sequential nature of the problem is presented.
M. Ceriotti, Becerra, Victor M., Nasuto, S. J., Nasuto, S.J., C. Bombardelli, Anderson, J., Bombardelli, C., Ceriotti, M., Anderson, James D., Becerra, V.M., Nasuto, Slawomir J., V.M. Becerra, Becerra, V. M., S.J. Nasuto, J. Anderson, Bombardelli, Claudio   +15 more
core   +3 more sources

DIFFERENTIAL EVOLUTION WITH COMPETITIVE SETTING OF CONTROL PARAMETERS

TASK Quarterly, 2007
This paper is focused on the adaptation of control parameters in differential evolution. Competition of various control parameter settings was proposed in order to ensure self-adaptation of parameter values in the search process.
JOSEF TVRD´IK
doaj  

A Direct Search Algorithm for Global Optimization

Algorithms, 2016
A direct search algorithm is proposed for minimizing an arbitrary real valued function. The algorithm uses a new function transformation and three simplex-based operations.
Enrique Baeyens, Alberto Herreros, José R. Perán   +2 more
doaj   +1 more source

From junk to function — How weak selection in eukaryotes builds new parts and drives genomic complexity

FEBS Letters, EarlyView.
How do genomes gain new functional parts? In eukaryotes, which tend to evolve under weak selection, much of the genome is junk. Palazzo and Qiu borrow the logic of Markov chains to show how non‐functional DNA becomes functional through the appearance of intermediate states, which arise due to epistasis, buffering, and biochemical messiness, allowing ...
Alexander F. Palazzo, Yi Qiu
wiley   +1 more source

Biased random-key genetic algorithm for bound-constrained global optimization [PDF]

, 2012
Global optimization seeks a minimum or maximum of a multimodal function over a discrete or continuous domain. In this paper, we propose a biased random-key genetic algorithm for finding approximate solutions for continuous global optimization problems ...
R. M. A. Silva, P. M. Pardalos, J. F. Gonçalves, M. G. C. Resende   +3 more
core   +1 more source

Numerical analysis of quantization-based optimization

ETRI Journal
We propose a number-theory-based quantized mathematical optimization scheme for various NP-hard and similar problems. Conventional global optimization schemes, such as simulated and quantum annealing, assume stochastic properties that require multiple ...
Jinwuk Seok, Chang Sik Cho
doaj   +1 more source

Novelty search for global optimization

Applied Mathematics and Computation, 2019
Novelty search is a tool in evolutionary and swarm robotics for maintaining the diversity of population needed for continuous robotic operation. It enables nature-inspired algorithms to evaluate solutions on the basis of the distance to their k-nearest neighbors in the search space.
Iztok Fister 0001, Andrés Iglesias 0001, Akemi Gálvez, Javier Del Ser, Eneko Osaba, Iztok Fister Jr., Matjaz Perc, Mitja Slavinec   +7 more
openaire   +5 more sources

Preoperative circulating tumor cells integrated with imaging analysis for prognostic evaluation in head and neck squamous cell carcinoma

Molecular Oncology, EarlyView.
Detecting circulating tumor cells (CTCs) in blood before surgery may help predict outcomes in patients with head and neck squamous cell carcinoma (HNSCC). Here, we show when combined with tumor size and lymph node involvement from routine imaging, CTC status identifies high‐risk patients with poorer survival—offering a simple, minimally invasive tool ...
Susanne Flach, Gizem Abaci, Tom Huberty, Axel Lechner, Lukas Käsmann, Jens Ricke, Sophia Stöcklein, Martin Canis, Philipp Baumeister, Marianna Alunni‐Fabbroni   +9 more
wiley   +1 more source

Open Competency Optimization with Combinatorial Operators for the Dynamic Green Traveling Salesman Problem

Information
This paper proposes the Open Competency Optimization (OCO) approach, based on adaptive combinatorial operators, to solve the Dynamic Green Traveling Salesman Problem (DG-TSP), which extends the classical TSP by incorporating dynamic travel conditions ...
Rim Benjelloun, Mouna Tarik, Khalid Jebari   +2 more
doaj   +1 more source

Single‐cell DNA methylation profiling: Technologies, computation, and applications in precision oncology

Molecular Oncology, EarlyView.
Single‐cell DNA methylation (scDNAme) profiling maps epimutational clonal evolution, revealing mechanisms of malignancy and therapeutic resistance across diverse cancer types. By providing a high‐resolution landscape of intratumoral heterogeneity, these technologies empower precise patient stratification, guide the development of enhanced ...
Ik Soo Kim
wiley   +1 more source