I have been thinking about doing something like this for years. But I never seems to have time. But if someone started a open source project I would like to get involved.
I can do the GA algorithms, so we need someone to do the network code and someone to put together the web site.
By the way take a look at this.
On the 17. of July Roland Olsson posted to comp.ai a message saying he had made a program using ADATE The program searches after a SAT solver. The satisfiability problem (SAT) is one of the fundamental problems in theoretic computer science. If we had a fast algorithm to solve this problem, we could solve a big class of very interesting problems. Example factoring of big integers and solving the travling salesman problem.
Your can find more problems with instances here, if your are interested.
So if your computer got some spare time, give it a try.
Slashdot Mirror
Where a scientist have made a small "railroad" out of molecules.
I think it is great. We have to use something like this when we build our nanotech assemblers
Here your can read about Code Coverage Analysis.
Does anybody know if the linux kernel is tested with a covering tool ?
If not it could be a great project to do.
What we need is an objectiv messure when
a testing for a programme is complete.
Not many testers og programmer knows it.
But there is a kind of tools called
covering tools that gives that kind
of objectiv messure.
Well we should make a client independent of the actual problem.
Something like 3 parts.
a network part.
a search engine part.
and a problem definition part.
and a static interface between the parts.
So to do another problem your just write another problem definition part.
And to try another search algoritme your write a new search engine part.
I have been thinking about doing something like this for years.
But I never seems to have time.
But if someone started a open source project I would like to get
involved.
I can do the GA algorithms, so we need someone to do the network code
and someone to put together the web site.
By the way take a look at this.
On the 17. of July Roland Olsson posted to comp.ai a message saying he had made a program
using ADATE
The program searches after a SAT solver.
The satisfiability problem (SAT) is one of the fundamental problems
in theoretic computer science.
If we had a fast algorithm to solve this problem, we could solve a big
class of very interesting problems.
Example factoring of big integers and solving the travling salesman problem.
Your can find more problems with instances
here, if your are interested.
So if your computer got some spare time, give it a try.