Approximating the Crowd with a Budget



Approximating the wisdom of the crowd
Ertekin Bolelli, Şeyda; Rudin, Cynthia (2011-12-17)
The problem of “approximating the crowd” is that of estimating the crowd’s majority opinion by querying only a subset of it. Algorithms that approximate the crowd can intelligently stretch a limited budget for a crowdsourcing task. We present an algorithm, “CrowdSense,” that works in an online fashion to dynamically sample subsets of labelers based on an exploration/exploitation criterion. The algorithm produces a weighted combination of the labelers’ votes that approximates the crowd’s opinion.
Approximating the Nondominated Frontiers of Multi-Objective Combinatorial Optimization Problems
Koksalan, Murat; Lokman, Banu (2009-03-01)
Finding, all nondominated vectors for multi-objective combinatorial optimization (MOCO) problems is computationally very hard in general. We approximate the nondominated Frontiers of MOCO problems by fitting smooth hypersurfaces. For a given problem, we lit the hypersurface using a single nondominated reference vector. We experiment with different types of MOCO problems and demonstrate that in all cases the fitted hypersurfaces approximate all nondominated vectors well. We discuss that such an approximation...
Estimating the angle of total pi-electron energy
Gutman, I; Türker, Burhan Lemi (Elsevier BV, 2004-01-23)
The angle theta of total pi-electron energy of an alternant hydrocarbon is defined via: E-pi = 2rootne cos theta, where 2n or 2n + 1 is the number vertices and e the number of edges of the molecular graph, and E-pi is the respective HMO total pi-electron energy. The angle theta is sensitive to the structural differences between isomeric alternant hydrocarbons. Recently [J. Mol. Struct. (Theochem) 584 (2002) 183] an identity cos theta = [(e + n)/(2rootne)](1 + alpha - rootalpha2 + 2alpha) has been deduced, w...
Approximating structural responses with genetic programming.
Uşkay, Bora; Erbatur, Fuat; Department of Civil Engineering (2002)
Rebalancing the assembly lines with total squared workload and total replacement distance objectives
Girit, Utku; Azizoğlu, Meral (Informa UK Limited, 2020-01-01)
Assembly line balancing is an important and well recognised operations research problem. The current line balance may not stay optimal, even feasible, due to the disruptions in one or more workstations. In this study, after the disruption, we aim to rebalance the assembly line by considering the trade-off between workload balancing (fairness measure) and total replacement distance for the tasks assigned to the different workstations (stability measure). We try to generate all non-dominated objective functio...
Citation Formats
Ş. Ertekin Bolelli and H. Hirsh, “Approximating the Crowd with a Budget,” 2014, Accessed: 00, 2021. [Online]. Available: