Forums before death by AOL, social media and spammers... "We can't have nice things"
|    comp.ai    |    Awaiting the gospel from Sarah Connor    |    1,954 messages    |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
|    Message 1,454 of 1,954    |
|    Joachim Pimiskern to jasonjeffreyjones@gmail.com    |
|    Re: How to order from noisy comparisons?    |
|    15 Jul 07 04:28:32    |
      From: JoachimPimiskern@web.de              jasonjeffreyjones@gmail.com schrieb:       > Assume we have a set of unordered items, e.g. [e,c,a,d,f,b]. There       > exists some true ordering (e.g. [a,b,c,d,e,f]) but it is unknown to       > us.              You need to find a real number vector that assigns a number to       each of the items, so that the common <= relation corresponds       as much as possible to your fuzzy data. This is an optimization       problem which can be approximated e.g. by evolutionary algorithms.              Regards,       Joachim              [ comp.ai is moderated ... your article may take a while to appear. ]              --- SoupGate-Win32 v1.05        * Origin: you cannot sedate... all the things you hate (1:229/2)    |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
(c) 1994, bbs@darkrealms.ca