Experimental analysis of randomized calculations of average rankings

dc.contributor.author	Zeiß, Tim
dc.date.accessioned	2017-10-26T13:25:50Z
dc.date.available	2017-10-26T13:25:50Z
dc.date.issued	2016	de
dc.description.abstract	Listing a set of points, such that a point gets a higher rank, if none of its coordinates is smaller, creates a partial order. It is possible to get a ranking without randomly favoring certain points, by averaging all valid rankings. However, this brute force algorithm is too slow for more than ten points. To handle more points, we will give a randomized, approximative approach to solve this problem and analyze the convergence rates of different strategies.	en
dc.identifier.other	496362712
dc.identifier.uri	http://nbn-resolving.de/urn:nbn:de:bsz:93-opus-ds-93306	de
dc.identifier.uri	http://elib.uni-stuttgart.de/handle/11682/9330
dc.identifier.uri	http://dx.doi.org/10.18419/opus-9313
dc.language.iso	en	de
dc.rights	info:eu-repo/semantics/openAccess	de
dc.subject.ddc	004	de
dc.title	Experimental analysis of randomized calculations of average rankings	en
dc.title.alternative	Experimentelle Analyse randomisierter Berechnungen gemittelter Rankings	de
dc.type	bachelorThesis	de
ubs.fakultaet	Informatik, Elektrotechnik und Informationstechnik	de
ubs.institut	Institut für Formale Methoden der Informatik	de
ubs.publikation.seiten	33, 10	de
ubs.publikation.typ	Abschlussarbeit (Bachelor)	de

Files

Now showing 1 - 1 of 1

Now showing 1 - 1 of 1