Results 121 to 130 of about 1,967,671 (302)
Rigorous Results in Combinatorial Optimization
Many current deterministic solvers for NP-hard combinatorial optimization problems are based on nonlinear relaxation techniques that use floating point arithmetic. Occasionally, due to solving these relaxations, rounding errors may produce erroneous results, although the deterministic algorithm should compute the exact solution in a finite number ...
openaire +4 more sources
Time‐resolved X‐ray solution scattering captures how proteins change shape in real time under near‐native conditions. This article presents a practical workflow for light‐triggered TR‐XSS experiments, from data collection to structural refinement. Using a calcium‐transporting membrane protein as an example, the approach can be broadly applied to study ...
Fatemeh Sabzian‐Molaei +3 more
wiley +1 more source
The constrained bi-objective stochastic optimization problem (CBSOP) considers the optimization problem with stochastic bi-objective functions subject to deterministic constraints.
Shih-Cheng Horng, Shieh-Shing Lin
doaj +1 more source
Proportional Fairness for Combinatorial Optimization
Proportional fairness (PF) is a concept widely studied in the literature, particularly in the fields of telecommunications, network design, resource allocation, and social choice. It aims to distribute utilities in a way that ensures fairness and equity among users while optimizing system performance.
Nguyen, Minh Hieu +3 more
openaire +2 more sources
Neural combinatorial optimization: A tutorial
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Angioni D., Archetti C., Speranza M. G.
openaire +2 more sources
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
Optimizing photoactivation of PA‐mCherry for optical pooled CRISPR screens
Photoactivatable PA‐mCherry finds widespread use to optically tag individual cells. However, confocal 405 nm UV laser‐scanning (normal scan) is much less efficient than widefield UV illumination, limiting the use of PA‐mCherry on confocal instruments. We remedy this limitation by reporting that rapid and repeated confocal scanning with a low‐intensity,
Sravasti Mukherjee +3 more
wiley +1 more source
The dFoCC pipeline starts with observed DED and resting‐state coordinates, which are then used to generate a library of triggered states. Correlation analysis of the calculated DED features of each candidate vs observed DED permits quantitative evaluation of candidate structural quality.
Meng Iao Fong +3 more
wiley +1 more source
RoundMi: A quantitative method to analyze mitochondrial morphology in mitotic cells
RoundMi is a workflow for rapid analysis of mitochondrial morphology in mitotic cells. By combining adaptive preprocessing with automated segmentation and quantification, it enables accurate measurements from single focal plane images, reducing acquisition time and computational demands while remaining compatible with high‐throughput fixed and live ...
Elmira Parvindokht Bararpour +2 more
wiley +1 more source
Advances in LLM-Assisted Combinatorial Optimization
Combinatorial optimization (CO) concerns decision-making over discrete solution spaces under constraints and lies at the core of many complex systems across science, engineering, and society.
Chuyue Tian +4 more
doaj +1 more source

