Algorithm comparison and description
$30-250 USD
Paid on delivery
There are 3 algorithm that should do nearly the same but they are different in order to improve performance.
Forst of all NW: [login to view URL]
Some A* variation of it is used in YA : [login to view URL]
And also there is GPU version of it GP: [login to view URL]
In YA they did not use normal NW in order improve speed of the program. But what I discovered is that if we run YA that uses normal NW insted of their optimized A* method I get better quality results. I need to know why is it possible. What is more what I use GP algorithm instead of YA I get faster results and those results are even better thatn those from NW.
So what I need is a comparison (description + diagrams with description and selection in dofferences) of those 3 algorithms. I also need to know why (basing on the algorithm) it is possible for them to differ in results and why one can possibly retursn better results than the other.
Project ID: #6776851
About the project
4 freelancers are bidding on average $191 for this job
Hello I'm interesting your project very well I'm a Good C/C++, Math, Algorithm expert. I m quite well experienced in these jobs. Let's go ahead with me I want to service for you continously. Thanks
hello i am a phd in computer science and engineering. i can do this algorithm task perfectly. i can give you a sample solution(message me for that). plz provide detail information. thanks
We are the leading young professional software development organization having extensive technical expertise and knowledge in developing, managing, optimizing and customizing software’s by implementing these software’s More
