How to Aggregate Top-Lists: Approximation Algorithms via Scores and Average Ranks

doi 10.1137/1.9781611975994.171
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial and Applied Mathematics

Related search

Correction To: Approximation and Online Algorithms

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2020English

Convergence Results for Ant Routing Algorithms via Stochastic Approximation

ACM Transactions on Autonomous and Adaptive Systems
ControlSystems EngineeringComputer ScienceSoftware
2013English

Public Research System: Sub-Dimension Average Scores and Indicator Scores

2018English

Innovation in Firms: Sub-Dimension Average Scores and Indicator Scores

2018English

Trade Policy Formulation and Evaluation: Sub-Dimension Average Scores and Indicator Scores

2018English

Speaking Stata: How to Face Lists With Fortitude

Stata Journal
Mathematics
2002English

Automatic Extraction of Top-K Lists From Web

IARJSET
2017English

Planning: Sub-Dimension Average Score and Indicator Scores

2018English

How to Analyse Evolutionary Algorithms

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2002English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy