Abstract: Scaffold filling is a new combinatorial optimization problem in genome sequencing. The one-sided scaffold filling problem can be described as given an incomplete genome $(I)$ and a complete ...
Abstract: This article presents an approximation algorithm for a Task Allocation, Sequencing and Scheduling Problem (TASSP) involving a team of human operators and robots. The robots have to travel to ...
Computing the minimal volume oriented bounding box for a given point cloud in 3D is a hard problem in computer science. Exact algorithms are known and of cubic order in the number of points in 3D. A ...
1 Tianjin Engineering Research Center of Civil Aviation Energy Environment and Green Development, Civil Aviation University of China, Tianjin, China. 2 Groupe d’Acoustigue de l’ Université de ...
Non-linear regression modeling is common in epidemiology for prediction purposes or estimating relationships between predictor and response variables. Restricted cubic spline (RCS) regression is one ...
Finding bipartite matchings is one of the oldest and most well-studied problems in computer science. This problem comes up in many guises, such as when matching donors to recipients for organ ...
Fuel–coolant interaction (FCI) has a pivotal role in the development of core disruptive accident in a sodium-cooled fast reactor. The drastic deformation of multiphase interface in the FCI is hard to ...
Correspondence to Dr Diana Bonderman, Department of Internal Medicine II, Medical University of Vienna, Wien, Austria; diana.bonderman{at}meduniwien.ac.at Background Diagnosis of cardiac amyloidosis ...
Worse-case analysis takes a “Murphy’s Law” approach to algorithm analysis, which is too crude to give meaningful algorithmic guidance for many important problems, including linear programming, ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results