This paper proposes a new approach to describe the salient contours in cluttered scenes. No need to do the preprocessing, such as edge detection, we directly use a set of random s...
Abstract— The widespread success of sampling-based planning algorithms stems from their ability to rapidly discover the connectivity of a configuration space. Past research has ...
— In this paper, we present an analytic model and methodology to determine optimal scheduling policy that involves two dimension space allocation: time and code, in High Speed Do...
Hussein Al-Zubaidy, Jerome Talim, Ioannis Lambadar...
We study the online ad-auctions problem introduced by Mehta et. al. [15]. We design a (1 − 1/e)competitive (optimal) algorithm for the problem, which is based on a clean primal-...
Abstract— We compare two alternative mechanisms for capping prices in two-settlement electricity markets. With sufficient lead time and competitive entry opportunities, forward ...
Jian Yao, Bert Willems, Shmuel S. Oren, Ilan Adler