Show Bid Request
Statistics
Bid Request Id: 35042
|
|
|
Posted by: |
SimuGD (14 ratings)
(Software buyer rating 10)
|
Non-action Ratio: |
Very Good - 0.00%
|
Buyer Security Verifications: |
Good
|
Approved on: |
Nov 12, 2002 8:11:37 AM EDT
|
Bidding Closes: |
Nov 13, 2002 10:15:04 AM EDT
|
Viewed (by coders): |
139 times
|
Deadline: |
11/15/2002 11:59:00 PM
TIME EXPIRED
|
|
|
|
Description:
Nonparametric statistical inference. In particular, the two-way table to compare 5 heuristic method in finding out the shortest route in the TSP problem.
DESCRIPTION: Suppose there are k heuristic methods to solve the TSP problem and suppose n randomly sampled maps are used to do this comparison. We wish to make the claim that some methods are better than others, i.e. to test the hypothese:
Ho: There is no difference among the methods H1: There are differences
Let the performance be measured by the route distance found by each method. One way to test the two hypothesis without making any assumption on the scores (% over the shortest route) is to rank the performace of tge methods for each map - using 1 for the best and 2 for the second best,etc. Let rij be the rank of the jth method from the ith map; i = 1, 2,...,n and j = 1, 2,...k ( I will provide a table to help , which will give you the n and k. For now they are n=15 and k=5) Let rj = ∑ rij / n be the average rank of method j. A reasonable decision rule is to reject Ho if the variation among the rj is too large to find c to reject Ho when
s2 ≡ ∑ (rj - r)2 / (k - 1) > c where r = 1/k ∑ rj = k + 1 / 2
Write a program to determine c for the given k, n, and alpha. Use k = 4, n = 20 and alpha = 0.05 as an example. (Output c. You may do this by 10000 simulations).
Deliverables: 1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done.
2) Installation package that will install the software (in ready-to-run condition) on the platform(s) specified in this bid request.
3) Complete ownership and distribution copyrights to all work purchased.
Platform:
Windows XP
Must be 100% finished and received by buyer on:
Nov 15, 2002 11:59:00 PM EDT
Deadline legal notes: All times are expressed in the time zone of the site EDT (UT - 5). If the buyer omitted a time, then the deadline is 11:59:59 PM EDT on the indicated date.
Remember that contacting the other party outside of the site (by email, phone, etc.) on all business projects < $500 (before the buyer's money is escrowed) is a violation of both the software buyer and seller agreements.
We monitor all site activity for such violations and can instantly expel transgressers on the spot, so we thank you in advance for your cooperation.
If you notice a violation please help out the site and report it. Thanks for your help.
|
|
Bidding/Comments:
|
All monetary amounts on the site are in United States dollars.
Rent a Coder is a closed auction, so coders can only see their own bids and comments. Buyers can view every posting made on their bid requests. |
See all rejected bids (and all comments)
Name |
Bid Amount |
Date |
Coder Rating |
|
|
|
N/A
|
Nov 12, 2002 8:59:58 AM EDT
|
9.5
(Excellent)
|
|
|
I can't read the formulas very well, can you attach a document which displays correctly?
Also, what five methods do you want to compare? Do you have some code, or at least descriptions?
|
|
|
|
|
|