Results 91 to 100 of about 2,709,850 (294)
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
Iterative Compression and Exact Algorithms
International audienceIterative Compression has recently led to a number of breakthroughs in parameterized complexity. The main purpose of this paper is to show that iterative compression can also be used in the design of exact exponential time ...
Fomin, Fedor V. +4 more
core +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
An exact algorithm for graph partitioning
An exact algorithm is presented for solving edge weighted graph partitioning problems. The algorithm is based on a branch and bound method applied to a continuous quadratic programming formulation of the problem. Lower bounds are obtained by decomposing the objective function into convex and concave parts and replacing the concave part by an affine ...
William W. Hager +2 more
openaire +3 more sources
Exact Algorithms for the Satellite Image Selection Problem
Space 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
Performance analysis of character-based exact matching algorithms.
Performance analysis of character-based exact matching algorithms.
Omar Tayan (4393288) +5 more
core +1 more source
Transcripts enriched in codons that trigger P‐site tRNA‐mediated mRNA decay possess stable mRNA
PTMD codons were first described by Mendel et al. as mediators of an mRNA decay pathway dependent on the human protein CNOT3, homologous to yeast Not5. Our findings confirm that PTMD codons destabilize transcripts; however, unlike in yeast, the human pathway specifically targets and slightly destabilizes primarily stable mRNAs.
Rodolfo Lopes Carneiro +1 more
wiley +1 more source
Exact Algorithms for MRE Inference
Most Relevant Explanation (MRE) is an inference task in Bayesian networks that finds the most relevant partial instantiation of target variables as an explanation for given evidence by maximizing the Generalized Bayes Factor (GBF). No exact MRE algorithm has been developed previously except exhaustive search.
Xiaoyuan Zhu, Changhe Yuan
openaire +3 more sources
Exact and Approximation Algorithms for Weighted Matroid Intersection
In this paper, we propose new exact and approximation algorithms for the weighted matroid intersection problem. Our exact algorithm is faster than previous algorithms when the largest weight is relatively small. Our approximation algorithm delivers a (1 -
Kamiyama, Naoyuki, +5 more
core +1 more source
KDAC6 has been associated with cell motility and actin structures, but specific domain contributions are not established. The two catalytic domains have differential effects on motility and F‐actin regulation, affecting cortical F‐actin density, motility, stress fibers, and cell spreading.
Taylor V. Joseph +7 more
wiley +1 more source

