Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
— This paper presents a robot audition system that recognizes simultaneous speech in the real world by using robotembedded microphones. We have previously reported Missing Featur...
The GridBASE framework for database-driven grid computing is presented. The design and a prototype implementation of the framework is discussed. Industry-strength database technol...
We introduce a novel laser spectroscopic trace-gas sensor platform, LaserSPECks that integrates recently developed miniature quartz-enhanced photoacoustic spectroscopy (QEPAS) gas...
Stephen So, Farinaz Koushanfar, Anatoliy Kosterev,...
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...