Pages that link to "Item:Q5901128"
From MaRDI portal
The following pages link to Ordering by weighted number of wins gives a good ranking for weighted tournaments (Q5901128):
Displayed 21 items.
- Controlled perturbation of sets of line segments in \(\mathbb R^2\) with smart processing order (Q543787) (← links)
- Kernels for feedback arc set in tournaments (Q657916) (← links)
- An updated survey on the linear ordering problem for weighted or unweighted tournaments (Q970187) (← links)
- A randomized approximation algorithm for computing bucket orders (Q976119) (← links)
- Robust reductions from ranking to classification (Q1009271) (← links)
- On predictive accuracy and risk minimization in pairwise label ranking (Q1049275) (← links)
- Rank aggregation: new bounds for MCx (Q1630773) (← links)
- On the approximability of Dodgson and Young elections (Q1761290) (← links)
- Preference-based learning to rank (Q1959596) (← links)
- Supervised clustering of label ranking data using label preference information (Q2251433) (← links)
- Ranking tournaments with no errors. I: Structural description (Q2284746) (← links)
- On the kernelization of ranking \(r\)-CSPs: linear vertex-kernels for generalizations of feedback arc set and betweenness in tournaments (Q2345613) (← links)
- Aggregation of partial rankings, \(p\)-ratings and top-\(m\) lists (Q2379921) (← links)
- Feedback arc set problem in bipartite tournaments (Q2380064) (← links)
- Label ranking by learning pairwise preferences (Q2389690) (← links)
- A survey on the linear ordering problem for weighted or unweighted tournaments (Q2644372) (← links)
- An Algorithmic View of Voting (Q2827491) (← links)
- Fuzzy K-Minpen Clustering and K-nearest-minpen Classification Procedures Incorporating Generic Distance-Based Penalty Minimizers (Q5117225) (← links)
- Voting Procedures, Complexity of (Q5150301) (← links)
- Socially desirable approximations for dodgson’s voting rule (Q5501960) (← links)
- Algorithm selection on a meta level (Q6106469) (← links)