These are math’s most famous open questions. Solve one, and you’ll win a $1-million prize—but it’s only happened once since ...
This paper investigates the one-dimensional cutting stock problem considering two conflicting objective functions: minimization of both the number of objects and the number of different cutting ...
Abstract: The Nelder-Mead simplex method is a well-known algorithm enabling the minimization of functions that are not available in closed-form and that need not be differentiable or convex.
Telomere-to-telomere phased assemblies are standard expectations. To achieve these for diploid and even polyploid genomes, the contemporary approach involves at least two long-read sequencing ...
Abstract: Hyperspectral unmixing aims at identifying the hidden spectral signatures (or endmembers) and their corresponding proportions (or abundances) from an observed hyperspectral scene. Many ...
ABSTRACT: This paper presents a new dimension reduction strategy for medium and large-scale linear programming problems. The proposed method uses a subset of the original constraints and combines two ...
The problem of tensor completion has applications in healthcare, computer vision, and other domains. However, past approaches to tensor completion have faced a tension in that they either have ...
Youssef Marzouk, professor of aeronautics and astronautics and co-instructor for the 16.0002/18.0002 course this term. Credit: Gretchen Ertl A new MIT course teaches students computational science ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results