Despite the large amounts of runtime needed to adequately solve a combinatorial auction (CA), existing iterative CA auction protocols require winner determination during every rou...
Ryan Kastner, Christina Hsieh, Miodrag Potkonjak, ...
This paper compares three similar loop-grouping methods. All methods are based on projecting the n-dimensional iteration space Jn onto a k-dimensional one, called the projected sp...
Ioannis Drositis, Georgios I. Goumas, Nectarios Ko...
Linear inverse problems are very common in signal and image processing. Many algorithms that aim at solving such problems include unknown parameters that need tuning. In this work...
A method for linearly constrained optimization which modifies and generalizes recent box-constraint optimization algorithms is introduced. The new algorithm is based on a relaxed...
Abstract. In this paper an exact and complete analysis of the Lloyd–Max’s algorithm and its initialization is carried out. An effective method for initialization of Lloyd–Max...