We present a new optimization-based method for aggregating preferences in settings in which each voter expresses preferences over pairs of alternatives. Our approach to identifying a consensus partial ...

ABSTRACT: The purpose of reoptimization using approximation methods—application of knowledge about the solution of the initial instance I, provided to achieve a better quality of approximation ...

Add a description, image, and links to the maximum-subarray topic page so that developers can more easily learn about it.

Abstract: This paper presents a parallel algorithm for the maximum sub array problem implemented on a machine with GPUs. Given a sequence of numbers, the maximum subsequence is a contiguous ...

> A subarray `A[i], A[i+1], ..., A[j]` of `A` is said to be _turbulent_ if and only if: > * For `i <= k < j`, `A[k] > A[k+1]` when `k` is odd, and `A[k] < A[k+1]` when `k` is even; > * **OR**, for `i ...