-
Notifications
You must be signed in to change notification settings - Fork 28
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
Closest String Problem Inquiry #12
Comments
Hello, This code was for a project for a class in school. Unfortunately, I cannot find the report for it anymore. However, I think the algorithms were based on these papers:
I hope this is of some help to you. Let me know if you have more questions. Best Regards, |
Thank you, Arno!
In the first paper, I think the general concept of ACO is discussed without
spelling out how to specifically map CSP to ACO. In your C code, did you
implement your own interpretation of mapping CSP to ACO's parameters, or
were you following another paper specially on using ACO to solve CSP?
When I click on the second paper, it says permission denied. Could you
please share the paper or its title with me?
Thanks a lot!
…On Tue, Jan 25, 2022 at 12:32 AM Arno Moonens ***@***.***> wrote:
Hello,
This code was for a project for a class in school. Unfortunately, I cannot
find the report for it anymore. However, I think the algorithms were based
on these papers:
- ACO:
https://courses.cs.ut.ee/all/MTAT.03.238/2011K/uploads/Main/04129846.pdf
- MMAS:
https://d1wqtxts1xzle7.cloudfront.net/50286031/s0167-739x_2800_2900043-120161113-19066-1c3p2om-with-cover-page-v2.pdf?Expires=1643103103&Signature=UhmnYLHK0OHkOYjHUeYCkyM0-omMCJHERDgKvKud42XEUugJvvcJeAHMXapC8conzxlpjyJYoz5a~jggMkecVhEkL~soYvFYDEQ0onalxR-3b9e0k2ctSXo-PrStNaoC8NjMqCOQ-xBL1kGgbUuvh9hrFDGav~V0~C0pNSt0clLv4G0uOC9Q34mrJd6ZoVPyuI93jR6m4A7FyK--E8UoyY5ZbmtVO4NrWl~klUywqYPGeDfd6jv45qpqeHnxmsGhP6yVPma1v8frC-1pUXSDYb~16C7tz9DWXRu9D9YSoBq0ckPPbvZDP7kaXlGMXdnuYxxFl6OZ8qU1MQn2YcvpiQ__&Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA
I hope this is of some help to you. Let me know if you have more questions.
Best Regards,
Arno
—
Reply to this email directly, view it on GitHub
<#12 (comment)>,
or unsubscribe
<https://github.com/notifications/unsubscribe-auth/AQZAFAHNMCBAHDXJOVMUZYTUXZN3RANCNFSM5MD4JT5A>
.
Triage notifications on the go with GitHub Mobile for iOS
<https://apps.apple.com/app/apple-store/id1477376905?ct=notification-email&mt=8&pt=524675>
or Android
<https://play.google.com/store/apps/details?id=com.github.android&referrer=utm_campaign%3Dnotification-email%26utm_medium%3Demail%26utm_source%3Dgithub>.
You are receiving this because you authored the thread.Message ID:
***@***.***>
--
Let your smile change the world, but don't let the world change your smile.
~Shirley
|
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Hello there,
I'm currently researching and working on the Closest String Problem and came across your code implementing an MMAS and ACS ant colony algorithm. Your code was super helpful! Would you be able to point me towards the exact paper that your code is implemented from?
Thanks so much!
Shirley
The text was updated successfully, but these errors were encountered: