Powered by BOINC

Powered by BOINC

User of the day

Profile CynEdler
Amado is what is actually prepared on his beginning certification and he feels cozy when folks use
the whole title. Louisiana has normally been...


New test set was launched!
July 08, 2014, 20:00 MSD
It is need for the optimization of the solver smallexpx.

About smallexp and smallexpx
July 18, 2013, 00:01 MSD
Since March, the project carried out calculations associated with the application smallexp. The scientific problem of smallexp is the experimental calculation of the asymptotic growth of the maximum possible number of fragments in a sequence fixed length. It is important to get information on possible periodic structures. This is necessary for the development of efficient algorithms search for fragments of small order in character sequences (the order - the ratio of the length of the words to the minimum period). It's important for discrete mathematics. Smallexpx application has more efficient algorithm then smallexp application.

Articles about scientific problem:

R. Kolpakov, G. Kucherov, On Maximal Repetitions in Words, J. Discrete Algorithms 1(1) (2000), 159–186.

R. Kolpakov, G. Kucherov, Periodic structures in words, chapter for the 3rd Lothaire volume Applied Combinatorics on Words, Cambridge University Press, 2005.

M. Crochemore, C. Iliopoulos, M. Kubica, J. Radoszewski, W. Rytter, T. Walen, Extracting powers and periods in a string from its runs structure, Lecture Notes in Comput. Sci. 6393 (2010), 258–269.

New algorithm brought new results. New minimum is much better vs previous: -685.809.
January 19, 2012, 21:00 MSD
New algorithm brought new results. New minimum is much better vs previous: -685.809. New algorithm uses the results of the previous computations for generating new work units. And it worked!
New results are obtianed. The server was running out of work for a long time due to the end-of-year work pressure and Christmas holydays. Soon new improved version of the application will be deployed.
January 9, 2012, 12:00 MSD
The large experiment was finished and the previously found minimum improved to the value of: -683.84.
New results are obtianed.
October 7, 2011, 22:01 MSD
New results of the recent experiments are obtained: the newly found minimum is -683.783 which is significantly better w.r.t. the previous one (-681.871). The experiment started with a set of 4096 random points. The obtained improved points served as starting points for further processing. The process finished when no further improvement is possible. This experiment lasted for one month.

News is available as an RSS feed RSS.

Copyright © 2014 Institute for Systems Analysis of Russian Academy of Sciences