Search found 2 matches
- Mon Jan 12, 2015 11:06 am
- Forum: Algorithms
- Topic: Knight's journey (Time Limit Exceeded)
- Replies: 2
- Views: 2822
Re: Knight's journey (Time Limit Exceeded)
What is the time complexity of Sieve of Eratosthenes algorithm to find prime numbers?
- Sat Oct 11, 2014 12:02 pm
- Forum: Algorithms
- Topic: Approximated assignment problem
- Replies: 3
- Views: 5698
Re: Approximated assignment problem
Distribute all of those m tasks among the n computers so that the ratios of work computers have to do are approximately a1:a2:a3:....:an. One task is assigned only to one machine and no tasks should be left out without assignment.