Sciweavers

2882 search results - page 20 / 577
» Enhancements to the Voting Algorithm
Sort
View
IANDC
2010
67views more  IANDC 2010»
13 years 8 months ago
Parameterized computational complexity of Dodgson and Young elections
We show that the two NP-complete problems of Dodgson Score and Young Score have differing computational complexities when the winner is close to being a Condorcet winner. On the ...
Nadja Betzler, Jiong Guo, Rolf Niedermeier
AVSS
2006
IEEE
14 years 3 months ago
Registration of Multimodal Stereo Images Using Disparity Voting from Correspondence Windows
This paper presents a method for registering multimodal imagery in short range surveillance situations when the differences in object depths preclude any global registration techn...
Stephen J. Krotosky, Mohan M. Trivedi
GECCO
2007
Springer
195views Optimization» more  GECCO 2007»
14 years 1 months ago
Diverse committees vote for dependable profits
Stock selection for hedge fund portfolios is a challenging problem for Genetic Programming (GP) because the markets (the environment in which the GP solution must survive) are dyn...
Wei Yan, Christopher D. Clack
EUROGRAPHICS
2010
Eurographics
14 years 7 months ago
Electors Voting for Fast Automatic Shape Correspondence
This paper challenges the difficult problem of automatic semantic correspondence between two given shapes which are semantically similar but possibly geometrically very different...
Oscar Kin-Chung Au, Chiew-Lan Tai, Daniel Cohen-Or...
ALDT
2011
Springer
200views Algorithms» more  ALDT 2011»
12 years 9 months ago
Vote Elicitation with Probabilistic Preference Models: Empirical Estimation and Cost Tradeoffs
A variety of preference aggregation schemes and voting rules have been developed in social choice to support group decision making. However, the requirement that participants provi...
Tyler Lu, Craig Boutilier