KWSN Orbiting Fortress

Killerrabbit · Posted: Mon Sep 24, 2012 8:21 am Post subject: SubsetSum@Home

Another one of the new projects. Math based.

The Subset Sum problem is described as follows: given a set of positive integers S and a target sum t, is there a subset of S whose sum is t? It is one of the well-know, so-called “hard” problems in computing. It's actually a very simple problem, and the computer program to solve it is not extremely complicated. What's hard about it is the running time – all known exact algorithms have running time that is proportional to an exponential function of the number of elements in the set (for worst-case instances of the problem).

And it gets more complicated after that. On my computer it takes a little under 2 hours to complete a WU. We have a Knight team. We are currently 25th, but could easily reach the top 20.

http://volunteer.cs.und.edu/subset_sum/index.php
_________________

Blurf · Posted: Mon Sep 24, 2012 12:17 pm Post subject:

Its run by Travis Deselt who used to be involved with Milkyway
_________________

Sir Papa Smurph · Posted: Mon Sep 24, 2012 7:52 pm Post subject:

Ok Im in too
.

_________________
a.k.a. Licentious of Borg.........Resistance Really is Futile.......
and a Really Hoopy Frood who always knows where his Towel is...