Comparison of Voting Methods Using Complexity Functions and the Weak Theta Asymptotic Notation

No abstract is available for this paper.

• Publication year

  2015

• Venue

  Computer Science in Cars Symposium

• Publication date

  2015-08-06

• Fields of study

  Computer Science, Political Science

• Identifiers
  DOI 10.1109/CSCS.2015.93
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• A METHOD TO REPRESENT THE SEMANTIC DESCRIPTION OF A WEB SERVICE BASED ON COMPLEXITY FUNCTIONS

  2015cited by this paper
• A New Asymptotic Notation: Weak Theta

  2015cited by this paper
• Social choice theory

  2013cited by this paper
• Development of Copeland Score Methods for Determine Group Decisions

  2013cited by this paper
• Towards a Comprehensive Similarity Analysis of Voting Procedures Using Rough Sets and Similarity Measures

  2013cited by this paper
• UvA-DARE ( Digital Academic Repository ) Logic and social choice theory

  2012cited by this paper
• Social Voting Techniques: A Comparison of the Methods Used for Explicit Feedback in Recommendation Systems

  2011cited by this paper
• Computational Social Choice: Prospects and Challenges

  2011cited by this paper
• A METHOD TO COMPARE TWO COMPLEXITY FUNCTIONS USING COMPLEXITY CLASSES

  2010cited by this paper
• A Survey of Face Recognition Techniques

  2009cited by this paper
• Applications of Voting Theory to Information Mashups

  2008cited by this paper
• Electronic voting machines versus traditional methods: improved preference, similar performance

  2008cited by this paper
• An empirical comparison of min–max-modular k-NN with different voting methods to large-scale text categorization

  2008cited by this paper
• A Short Introduction to Computational Social Choice

  2007cited by this paper

• Online model-free sensor fault identification and dictionary learning in Cyber-Physical Systems

  2016cites this paper