Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Consider using swimd to solve 1:1 for large targets #16

Open
Martinsos opened this issue Jan 12, 2015 · 0 comments
Open

Consider using swimd to solve 1:1 for large targets #16

Martinsos opened this issue Jan 12, 2015 · 0 comments

Comments

@Martinsos
Copy link
Owner

Idea: I could use swimd for 1:1 solving, when target is large. If it is large enough, I could split it to pieces, solve them in parallel, and then combine them. I could use something similar to idea that is used for Hichberg. Possible problem is complexity of combining solutions together: if that part is too slow, the whole idea may not be worth it. Another thing to think about is how to exactly combine the solutions: I should examine Hichberg and start from there, there may also be some other articles that already used similar approach, I should find them and read them.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

1 participant