A team of scientists from Oak Ridge National Laboratory, Cleveland Clinic and IBM has calculated nine molecular ...
Combinatorial optimization problems are often encountered in real-world applications, including logistics, scheduling and ...
Zoraptera, also known as angel insects or ground lice, are tiny termite-like insects generally found underneath bark or in ...
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 ...
Adequate mathematical modeling is the key to success for many real-world projects in engineering, medicine, and other applied areas. Once a well-suited model is established, it can be thoroughly ...
This repository provides a software suite implementing Domain Elastic Transform (DET), Bayesian Coherent Point Drift (BCPD/GBCPD), and Dependent Landmark Drift (DLD), BCPD registers two point clouds, ...
Transportation Science, Vol. 38, No. 3 (August 2004), pp. 343-356 (14 pages) Bounds and approximate formulae are developed for the average optimum distance of the transportation linear programming ...
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 ...
Download PDF Join the Discussion View in the ACM Digital Library The maximum flow problem and its generalization, the minimum-cost flow problem, are classic combinatorial graph problems that find ...