Abstract: Linear spectral unmixing aims at estimating the number of pure spectral substances, also called endmembers, their spectral signatures, and their abundance fractions in remotely sensed ...

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 ...

In this paper a new hybrid glowworm swarm algorithm (SAGSO) for solving structural optimization problems is presented. The structure proposed to be optimized here is a simply-supported concrete I-beam ...

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.

The original version of this story appeared in Quanta Magazine. In 1939, upon arriving late to his statistics course at UC Berkeley, George Dantzig—a first-year graduate student—copied two problems ...

The leading approach to the simplex method, a widely used technique for balancing complex logistical constraints, can’t get any better. In 1939, upon arriving late to his statistics course at the ...

remove-circle Internet Archive's in-browser bookreader "theater" requires JavaScript to be enabled. It appears your browser does not have it turned on. Please see ...

Since its creation more than two decades ago by Daniel Spielman (above) and Shang-hua Teng, smoothed analysis has been used to analyze performance of algorithms other than the simplex method, ...

Single-cell multiomics sequencing techniques have rapidly developed in the past few years. Among these techniques, single-cell cellular indexing of transcriptomes and epitopes (CITE-seq) allows ...

Nestled among the impressive domes and spires of Yale University is the simple office of Daniel Spielman. His shelves are lined with tall black notebooks, containing decades of handwritten notes, and ...