Results 51 to 60 of about 17,512 (264)

On metaheuristic algorithms for combinatorial optimization problems [PDF]

open access: yesSystems and Computers in Japan, 2001
Metaheuristic algorithms are widely recognized as one of the most practical approaches for combinatorial optimization problems. Among representative metaheuristics are genetic algorithms, simulated annealing, tabu search, and so on. In this paper, we explain essential ideas used in such metaheuristic algorithms within a generalized framework of local ...
Mutsunori Yagiura, Toshihide Ibaraki
openaire   +1 more source

Analysing the significance of small conformational changes and low occupancy states in serial crystallographic data

open access: yesFEBS Open Bio, EarlyView.
This protocol paper outlines methods to establish the success of a time‐resolved serial crystallographic experiment, by means of statistical analysis of timepoint data in reciprocal space and models in real space. We show how to amplify the signal from excited states to visualise structural changes in successful experiments.
Jake Hill   +4 more
wiley   +1 more source

One size does not fit all: An in vitro evaluation of the effects of bezafibrate and medroxyprogesterone acetate on human SH‐SY5Y and U‐87 MG cancer cells

open access: yesFEBS Open Bio, EarlyView.
Drugs previously repurposed to target blood cancers reduced neuroblastoma and glioblastoma cell growth and viability. However, their levels of anticancer activity were different and their clinical application may be problematic due to side effects at effective doses.
Abhishek Kharawatkar   +4 more
wiley   +1 more source

APPLICATIONS OF BRANCH-BOUND ALGORITHM TO SOLVE SOME OPTIMAL PROBLEMS RELATED TO THE HAMILTONIAN CYCLE BASED ON THE TSP

open access: yesTạp chí Khoa học Đại học Đà Lạt, 2017
The Traveling Salesman Problem (TSP) is the most prominent of the combinatorial optimization problems that belongs to NP-Hard. The best algorithm for solving TSP is the branch-bound algorithm with exponential-time complexity.
Đỗ Như An
doaj   +1 more source

On the Problem of a Linear Function Localization on Permutations

open access: yesКібернетика та комп'ютерні технології, 2020
Combinatorial optimization problems and methods of their solution have been a subject of numerous studies, since a large number of practical problems are described by combinatorial optimization models.
G.A. Donets, V.I. Biletskyi
doaj   +1 more source

Protocol for quantifying miRNA trafficking across the endosomal membrane

open access: yesFEBS Open Bio, EarlyView.
An in vitro protocol measures miRNA uptake into endosomes isolated from mammalian cell extracts, which are free of subcellular contaminants. Performed at 37 °C in the presence of ATP, it ensures the import of single‐stranded miRNA into the endosomal lumen.
Syamantak Ghosh   +2 more
wiley   +1 more source

MATHEMATICAL MODEL FOR OPTIMIZATION PROBLEM OF ONE MULTIPROCESSING COMPUTER SYSTEM AND ITS SOLUTION

open access: yesМіжнародний науково-технічний журнал "Проблеми керування та інформатики", 2011
The mathematical model of task of the work optimization of multiprocessing computer system as Euclidian combinatorial optimization problem on vertex-located set is formed.
O.A. Yemets   +2 more
doaj   +1 more source

A Combinatorial Optimization Approach for Air Cargo Palletization and Aircraft Loading

open access: yesMathematics, 2023
The current air cargo loading plan handles the Air Cargo Palletization Problem (ACPP) and the Aircraft Weight and Balance Problem (WBP) separately, which has an impact on the optimization of the payload and the aircraft’s center of gravity (CG).
Xiangling Zhao, Yun Dong, Lei Zuo
doaj   +1 more source

Approximating Incremental Combinatorial Optimization Problems.

open access: yes, 2017
We consider incremental combinatorial optimization problems, in which a solution is constructed incrementally over time, and the goal is to optimize not the value of the final solution but the average value over all timesteps. We consider a natural algorithm of moving towards a global optimum solution as quickly as possible. We show that this algorithm
Goemans, Michel X, Unda, Francisco Tomas
openaire   +5 more sources

Chronobiology of Cancer: How Aging Fuels Oncogenesis at the Molecular Level

open access: yesAging and Cancer, EarlyView.
This graphical abstract illustrates the key biological pathways linking aging with cancer development and progression. In the upper left, cumulative exposure to ultraviolet radiation, toxins, and reactive oxygen species (ROS) causes DNA damage and genomic instability, whereas age‐related decline in repair mechanisms, such as ATM/ATR, BER, and NER ...
Anu Singh, Aroonima Misra, Sufian Zaheer
wiley   +1 more source

Home - About - Disclaimer - Privacy