نتایج جستجو برای: pairwise comparisons
تعداد نتایج: 110269 فیلتر نتایج به سال:
A common technique for improving the quality of crowdsourcing results is to assign a same task to multiple workers redundantly, and then to aggregate the results to obtain a higher-quality result; however, this technique is not applicable to complex tasks such as article writing since there is no obvious way to aggregate the results. Instead, we can use a two-stage procedure consisting of a cre...
The high cost of non-compliance with laws and regulations that govern software systems makes legal requirements prioritization crucial. In addition, software design, expense, and time constraints all influence how requirements are prioritized. Prioritizing requirements derived from laws and regulations can be untenable using traditional pairwise requirements prioritization techniques because th...
Ranking a set of items given preferences among them is a fundamental problem that arises naturally in several real world situations such as ranking candidates in elections, movies, sports teams, documents in response to a query to name a few. In each of these situations, the preference data among the items to be ranked may be available in different forms: as pairwise comparisons, partial orderi...
Nihar B. Shah† [email protected] Sivaraman Balakrishnan# [email protected] Joseph Bradley† [email protected] Abhay Parekh† [email protected] Kannan Ramchandran† [email protected] Martin J. Wainwright† ? [email protected] † Department of Electrical Engineering and Computer Sciences ? Department of Statistics, University of California, Berkeley Berkeley, CA-94720...
The expected number of pairwise comparisons needed to learn a partial order on n elements is shown to be at least n/4 − o(n), and an algorithm is given that needs only n/4 + o(n) comparisons on average. In addition, the optimal strategy for learning a poset with four elements is presented.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید