Results 51 to 60 of about 6,800,360 (294)
Organoids in pediatric cancer research
FEBS Letters, EarlyView.Organoid technology has revolutionized cancer research, yet its application in pediatric oncology remains limited. Recent advances have enabled the development of pediatric tumor organoids, offering new insights into disease biology, treatment response, and interactions with the tumor microenvironment.
Carla Ríos Arceo, Jarno Drost
wiley +1 more source
Multicriteria combinatorial optimization problems on a set of polypermutations. [PDF]
, 2008 The studies on multicriteria combinatorial optimization are continued. A possible approach to solving multicriterion problems is developed and substantiated. An algorithm is developed and implemented.
Koliechkina, L. +3 more
core
Engineering peptides into antibodies—opportunities and strategies for therapeutic innovation
FEBS Letters, EarlyView.Peptides and antibodies occupy complementary therapeutic niches. Peptides recognize difficult targets in a compact format, while antibodies add specificity, long half‐life, and effector functions. This review examines strategies that merge both modalities—peptide grafting into loops, terminal and Fc fusions, and bioconjugation—highlighting how ...
Jinling Wang +2 more
wiley +1 more source
Guiding Principle for Minor-Embedding in Simulated-Annealing-Based Ising Machines
IEEE Access, 2020 We propose a novel type of minor-embedding (ME) in simulated-annealing-based Ising machines. The Ising machines can solve combinatorial optimization problems. Many combinatorial optimization problems are mapped to find the ground (lowest-energy) state of
Tatsuhiko Shirai +2 more
doaj +1 more source
Symmetric tensor networks for generative modeling and constrained combinatorial optimization
Machine Learning: Science and Technology, 2023 Constrained combinatorial optimization problems abound in industry, from portfolio optimization to logistics. One of the major roadblocks in solving these problems is the presence of non-trivial hard constraints which limit the valid search space.
Javier Lopez-Piqueres +2 more
doaj +1 more source
Formulations and Metaheuristics for combinatorial optimization problems [PDF]
, 2022 Combinatorial optimization problems have been strongly addressed throughout history. Their study involves highly applied problems that must be solved in reasonable times. This doctoral Thesis addresses three Operations Research problems: the first deals with the Traveling Salesman Problem with Pickups and Delivery with Handling cost, which was ...
openaire +2 more sources
Going viral − Virus‐targeting nanobodies for research, diagnostics and therapy
FEBS Letters, EarlyView.The increasing prevalence of viral diseases represents a major threat for global human health. Nanobodies, small binding fragments derived from camelid heavy‐chain antibodies, offer versatile tools for viral research, diagnostics, and antiviral therapy.
Domenic Ebert, Ulrich Rothbauer
wiley +1 more source
Recursive Quantum Relaxation for Combinatorial Optimization Problems [PDF]
QuantumQuantum optimization methods use a continuous degree-of-freedom of quantum states to heuristically solve combinatorial problems, such as the MAX-CUT problem, which can be attributed to various NP-hard combinatorial problems.
Ruho Kondo +3 more
doaj +1 more source
The combinatorial optimization problems of the discrete processes
Lietuvos Matematikos Rinkinys, 2021 Nonclassic combinatorial optimization problems of the discrete processes are investigated. The methodology, permitting transform there problems into equivalent typical problems, which can be solved applying dynamic programming and principle of the ...
Nijolė Janušauskaitė
doaj +1 more source
On metaheuristic algorithms for combinatorial optimization problems [PDF]
Systems 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 +2 more sources