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

To make a truly realistic fake picture of a galaxy, you can model exactly how light particles travel through the atmosphere ...

The bookshelf problem (which computer scientists call the “list labeling” problem) is one of the most basic topics in the field of data structures. “It’s the kind of problem you’d teach to freshman or ...

Solving life's great mysteries often requires detective work, using observed outcomes to determine their cause. For instance, ...

Will algorithms designed for interconnected computers hold up if some of the machines are not here on Earth but flying about ...

Knot theory is a field of mathematics called ‘low-dimensional topology’, with a history, stemming from an idea proposed by Lord Kelvin, who conjectured that chemical elements are different knots ...

An enumerative scheme is presented for the (0,1) knapsack problem as a specialization of the state enumeration method. Techniques are explored for rendering search procedures more efficient by ...