BOINC Projects

BOINC projects: Difference between revisions

← Older editNewer edit →
VisualWikitext
Al Piskun (talk | contribs)
1,456 edits
update os - time out is good
Al Piskun (talk | contribs)
1,456 edits
No edit summary
Line 99: Line 99:
| Study the Collatz conjecture, an unsolved conjecture in mathematics
| Study the Collatz conjecture, an unsolved conjecture in mathematics
|-
|-
| [http://www.cosmologyathome.org/ Cosmology@Home]
| [https://www.cosmologyathome.org/ Cosmology@Home]
|[https://www.cosmologyathome.org/server_status.php 87465 Participants]
|[https://www.cosmologyathome.org/server_status.php 87465 Participants]
|[https://www.boincitaly.org/articoli/scienza-e-ricerca/2794-pubblicazioni-ast-fis-e-chim.html#cosmology 6 papers]
|[https://www.boincitaly.org/articoli/scienza-e-ricerca/2794-pubblicazioni-ast-fis-e-chim.html#cosmology 6 papers]
Line 435: Line 435:
| Conjecturing new mathematical formulas
| Conjecturing new mathematical formulas
|-
|-
| RNA World (computing project) |[http://www.rnaworld.de/rnaworld/ RNA World]
| RNA World (computing project) |[https://www.rnaworld.de/rnaworld/ RNA World]
|
|
|
|
Line 471: Line 471:
|Independent decentralized drug design by volunteer computing.
|Independent decentralized drug design by volunteer computing.
|-
|-
|[http://srbase.my-firewall.org/sr5/ SRBase]
|[https://srbase.my-firewall.org/sr5/ SRBase]
|
|
|
|
Line 555: Line 555:
| Collect various statistics about other BOINC projects
| Collect various statistics about other BOINC projects
|-
|-
| [http://yafu.myfirewall.org/yafu YAFU]
| [https://yafu.myfirewall.org/yafu YAFU]
|
|
|
|
Line 569: Line 569:
| [https://www.rechenkraft.net/yoyo/ Yoyo@home]
| [https://www.rechenkraft.net/yoyo/ Yoyo@home]
|
|
|[http://www.biomedcentral.com/1471-2148/8/125 paper]
|[https://www.biomedcentral.com/1471-2148/8/125 paper]
| 2007-07-19
| 2007-07-19
|
|
Line 1,080: Line 1,080:
|The Travelling salesman problem (TSP); for a given set of cites, visit each city once (once and only once) and minimize the distance you travel. This deceptively simple problem is trivial given a small set of cities, however, as you add more cities the number of possible paths goes through the roof.
|The Travelling salesman problem (TSP); for a given set of cites, visit each city once (once and only once) and minimize the distance you travel. This deceptively simple problem is trivial given a small set of cities, however, as you add more cities the number of possible paths goes through the roof.
|-
|-
|[http://xw01.lri.fr:4320/ XtremLab]
|[https://web.archive.org/web/20060412015807/http://xw01.lri.fr:4320/ XtremLab]
|
|
|2005
|2005
Line 1,243: Line 1,243:
|
|
|2007-08-27
|2007-08-27
| [http://dist2.ist.tugraz.at/sudoku/apps.php WinXP-98, Linux, MacOS]
| [https://web.archive.org/web/20080307034907/http://dist2.ist.tugraz.at/sudoku/apps.php WinXP-98, Linux, MacOS]
|
|
|Graz University of Technology
|Graz University of Technology
Line 1,250: Line 1,250:
|A research project that uses Internet-connected computers to search for the smallest possible start configuration of Sudoku
|A research project that uses Internet-connected computers to search for the smallest possible start configuration of Sudoku
|-
|-
|[http://www.apsathome.org/ APS@Home]
|[https://web.archive.org/web/20071005080915/http://www.apsathome.org:80/ APS@Home]
|
|
|2007-08-30
|2007-08-30
Line 1,278: Line 1,278:
|
|
|
|
|A distributed computing project designed to find new lower bounds for various Ramsey numbers using a host of different techniques. It was inspired by the research of Dr. David Furcy, Dr. Thomas Naps, Dr. Linda Eroh, and Nick Peterson during the 2008 spring and summer semester at the University of Wisconsin-Oshkosh.
|A volunteer computing project designed to find new lower bounds for various Ramsey numbers using a host of different techniques. It was inspired by the research of Dr. David Furcy, Dr. Thomas Naps, Dr. Linda Eroh, and Nick Peterson during the 2008 spring and summer semester at the University of Wisconsin-Oshkosh.
|-
|-
| [http://canis.csc.ncsu.edu:8005/anansi/ Anansi]
| [http://canis.csc.ncsu.edu:8005/anansi/ Anansi]
Line 3,103: Line 3,103:
|Mathematics
|Mathematics
|
|
|Van Der Waerden Numbers is a research project that uses Internet-connected computers to find better lower bounds for these numbers. Static mirror for this project: http://www.123numbers.org/
|Van Der Waerden Numbers is a research project that uses Internet-connected computers to find better lower bounds for these numbers. Static mirror for this project: https://www.123numbers.org/
|-
|-
| [http://burp.renderfarming.net/ Big and Ugly Rendering Project (BURP)]
| [http://burp.renderfarming.net/ Big and Ugly Rendering Project (BURP)]
Retrieved from "https://boincsynergy.ca/wiki/BOINC_projects"