Results 81 to 90 of about 8,140,957 (328)
Combinatorial optimization by simulating adiabatic bifurcations in nonlinear Hamiltonian systems
Science Advances, 2019 Nonlinear Hamiltonian systems search optimal solutions exploiting their adiabatic and chaotic evolutions. Combinatorial optimization problems are ubiquitous but difficult to solve.
Hayato Goto +2 more
semanticscholar +1 more source
FEBS 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
Protocol for quantifying miRNA trafficking across the endosomal membrane
FEBS 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
Tạ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
Кібернетика та комп'ютерні технології, 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
Approximating Incremental Combinatorial Optimization Problems.
, 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
Persistency in combinatorial optimization problems on matroids
Discrete Applied Mathematics, 2001 Algorithms on matroids to find maximum weight bases or to solve the cardinality intersection problem of two matroids are analyzed to obtain a persistency partition of the elements into 1-persistent elements, which belong to all optimal solutions, 0-persistent ones which do not belong to any optimal solution, and non-persistent elements which belong to ...
Katarína Cechlárová, Vladimír Lacko
openaire +2 more sources
GPU-based tuning of quantum-inspired genetic algorithm for a combinatorial optimization problem
, 2012 This paper concerns efficient parameters tuning (meta-optimization) of a state-of-the-art metaheuristic, Quantum-Inspired Genetic Algorithm (QIGA), in a GPU-based massively parallel computing environment (NVidia CUDAtechnology).
Robert Nowotniak, J. Kucharski
semanticscholar +1 more source
Chronobiology of Cancer: How Aging Fuels Oncogenesis at the Molecular Level
Aging 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
Clustering and combinatorial optimization in recursive supervised learning
, 2007 The use of combinations of weak learners to learn a dataset has been shown to be better than the use of a single strong learner. In fact, the idea is so successful that boosting, an algorithm combining several weak learners for supervised learning, has
Guan, S.U. +5 more
core +1 more source