Results 81 to 90 of about 2,298,639 (295)
CPSP-tools – Exact and complete algorithms for high-throughput 3D lattice protein studies
BMC Bioinformatics, 2008 Background The principles of protein folding and evolution pose problems of very high inherent complexity. Often these problems are tackled using simplified protein models, e.g. lattice proteins.
Will Sebastian +2 more
doaj +1 more source
Modified Gerchberg–Saxton (G-S) Algorithm and Its Application
Entropy, 2020 The Gerchberg–Saxton (G-S) algorithm is a phase retrieval algorithm that is widely used in beam shaping and optical information processing. However, the G-S algorithm has difficulty obtaining the exact solution after iterating, and an approximate ...
Tieyu Zhao, Yingying Chi
doaj +1 more source
Electronic Notes in Theoretical Computer Science, 2003 The maximum satisfiability problem (MAX-SAT) is stated as follows: Given a boolean formula in CNF, find a truth assignment that satisfies the maximum possible number of its clauses. MAX-SAT is MAX-SNP-complete and received much attention recently. One of the challenges posed by Alber, Gramm and Niedermeier in a recent survey paper asks: Can MAX-SAT be ...
Hantao Zhang 0001 +2 more
openaire +3 more sources
Molecular Oncology, EarlyView.This study integrates publicly available transcriptomic datasets to identify molecular signatures associated with response to neoadjuvant chemoradiotherapy in locally advanced rectal cancer. By analyzing a combination of multiple cohorts with bioinformatics approaches, we reveal biological pathways and immune‐related features that may improve ...
Aleksandra Stanojevic +10 more
wiley +1 more source
Exact Algorithms for the Satellite Image Selection Problem
International Journal of Applied Mathematics and Computer ScienceSpace development is more relevant than ever with the increasing number of satellite launches for various applications. The amount of space data collected daily is growing exponentially and many customers are interested in continuously monitoring ...
Swat Sylwester +4 more
doaj +1 more source
A family of global convergent inexact secant methods for nonconvex constrained optimization
Journal of Algorithms & Computational Technology, 2018 We present a family of new inexact secant methods in association with Armijo line search technique for solving nonconvex constrained optimization. Different from the existing inexact secant methods, the algorithms proposed in this paper need not compute ...
Zhujun Wang, Li Cai, Zheng Peng
doaj +1 more source
Exact algorithms for the matrix bid auction. [PDF]
In a combinatorial auction, multiple items are for sale simultaneously to a set of buyers. These buyers are allowed to place bids on subsets of the available items.
Goossens, Dries, Spieksma, Frederik
core
Hybrid meta-heuristics with VNS and exact methods:application to large unconditional and conditional vertex p-centre problems [PDF]
, 2015 Large-scale unconditional and conditional vertex p-centre problems are solved using two meta-heuristics. One is based on a three-stage approach whereas the other relies on a guided multi-start principle.
Irawan, Chandra +3 more
core +1 more source
An exact algorithm for subgraph homeomorphism
Journal of Discrete Algorithms, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Andrzej Lingas, Martin Wahlen
openaire +1 more source
FEBS Open Bio, EarlyView.RoboMic is an automated confocal microscopy pipeline for high‐throughput functional imaging in living cells. Demonstrated with fluorescence recovery after photobleaching (FRAP), it integrates AI‐driven nuclear segmentation, ROI selection, bleaching, and analysis.
Selçuk Yavuz +6 more
wiley +1 more source