Rakesearch: Difference between revisions
Project team / Sponsors add Natalia Nikitina |
→Scientific publications: link to Berkeley pubs page |
||
| Line 27: | Line 27: | ||
== Scientific publications == | == Scientific publications == | ||
https://boinc.berkeley.edu/pubs.php#Rakesearch | |||
# | |||
Revision as of 00:02, 27 January 2025
[[File:{{#setmainimage:Squares.png}}|alt=logo image|center|frameless]]
RakeSearch is a BOINC based volunteer computing project that needs your help to process diagonal Latin squares.
Why RakeSearch?
- why this topic/object of study?
Goal
Investigate the diagonal Latin squares space.
Methods
The enormous size of the diagonal Latin squares space makes it unfeasible to enumerate all its objects in reasonable time. Sophisticated search methods and the BOINC platform are essential to meet the computational requirements.
RakeSearch implements an application that picks up separate pairs of mutually orthogonal DLS, which allows reconstruction of full graphs of their orthogonality.
Source code:
Project team / Sponsors
Natalia Nikitina. hoarfrost. The searchers team, Karelian Research Center of the Russian Academy of Sciences.
Scientific results
https://rake.boincfast.ru/rakesearch/publications.php
https://rake.boincfast.ru/rakesearch/graphs.html