Results 61 to 70 of about 4,919,639 (299)
Performance Comparison of Typical Binary-Integer Encodings in an Ising Machine
IEEE Access, 2021 The differences in performance among binary-integer encodings in an Ising machine, which can solve combinatorial optimization problems, are investigated.
Kensuke Tamura +4 more
doaj +1 more source
Artificial molecular machines and motors—Design and control of nanoscale motion
FEBS Letters, EarlyView.Molecules are constantly moving because of thermal fluctuations, but random motion alone cannot be exploited to perform directional tasks. Artificial molecular machines use chemical, electrical, or light energy to bias this motion. Molecular shuttles, rotary motors, and supramolecular pumps illustrate how nanoscale movement can be controlled and ...
Leonardo Andreoni, Alberto Credi
wiley +1 more source
, 2000 In this thesis, we study neighbourhoods of exponential size that can be searched in polynomial time. Such neighbourhoods are used in local search algorithms for classes of combinatorial optimisation problems.
Congram, Richard K.
core +1 more source
Fermionic quantum approximate optimization algorithm
Physical Review Research, 2023 Quantum computers are expected to accelerate solving combinatorial optimization problems, including algorithms such as Grover adaptive search and quantum approximate optimization algorithm (QAOA). However, many combinatorial optimization problems involve
Takuya Yoshioka +3 more
doaj +1 more source
Finding novel vulnerabilities of hypomorphic BRCA1 alleles
Molecular Oncology, EarlyView.Synthetic lethality screens performed to identify novel vulnerabilities often model complete gene loss, thereby overlooking patient‐derived hypomorphic mutations. In this study, we have performed genome‐wide CRISPR screens on BRCA1 hypomorphic mutations, showing BRCA1I26A behaves like wild‐type, while BRCA1R1699Q mimics deficiency. Furthermore, we have
Anne Schreuder +10 more
wiley +1 more source
The Power of Human–Algorithm Collaboration in Solving Combinatorial Optimization Problems
Algorithms, 2021 Many combinatorial optimization problems are often considered intractable to solve exactly or by approximation. An example of such a problem is maximum clique, which—under standard assumptions in complexity theory—cannot be solved in sub-exponential time
Tapani Toivonen, Markku Tukiainen
doaj +1 more source
MITF maintains genome stability in nonmelanocyte lineages
Molecular Oncology, EarlyView.MITF is essential for melanocyte survival and acts as an oncogene in 10%–20% of melanomas. We show that MITF depletion causes genome instability in nonmelanocytic cells, leading to LATS2‐mediated P53 activation, cell cycle arrest, and apoptosis. This study highlights the role of MITF as a genome maintenance factor beyond the melanocyte lineage. Created
Drifa H. Gudmundsdottir +13 more
wiley +1 more source
Efficient Resource Allocation in RIS-Assisted UAVs-Enabled B5G/6G Networks Using Digital Twins
IEEE AccessRapid technological advancements have revolutionized how people live, work, and communicate. Given the rapidly growing need for data and bandwidth, replacing existing communication systems with agile and modern alternatives is crucial.
Aasma Shafi +2 more
doaj +1 more source
Molecular Oncology, EarlyView.Matched spatial transcriptomics and single‐nuclei RNA‐seq were generated for anaplastic and BRAFV600E papillary thyroid cancers revealing generic and tumor‐specific states occurring in cancer cells and in the tumor microenvironment. In this context, cancer dedifferentiation mirrored organoid maturation through ordered thyroid marker gain/loss ...
Adrien Tourneur +11 more
wiley +1 more source
On Large Sum-Free Sets: Revised Bounds and Patterns
MathematicsIn this paper, we rectify two previous results found in the literature. Our work leads to a new upper bound for the largest sum-free subset of [1,n] with the lowest value in n3,n2, and the identification of all patterns that can be used to form sum-free ...
Renato Cordeiro de Amorim
doaj +1 more source