Sciweavers

160 search results - page 7 / 32
» Approximability of Manipulating Elections
Sort
View
AAAI
2010
13 years 11 months ago
Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates
For many election systems, bribery (and related) attacks have been shown NP-hard using constructions on combinatorially rich structures such as partitions and covers. It is import...
Felix Brandt, Markus Brill, Edith Hemaspaandra, La...
FCT
2007
Springer
14 years 1 months ago
On Approximating Optimal Weighted Lobbying, and Frequency of Correctness Versus Average-Case Polynomial Time
We investigate issues regarding two hard problems related to voting, the optimal weighted lobbying problem and the winner problem for Dodgson elections. Regarding the former, Chris...
Gábor Erdélyi, Lane A. Hemaspaandra,...
DC
2008
13 years 9 months ago
Approximate distributed top- k queries
We consider a distributed system where each node keeps a local count for items (similar to elections where nodes are ballot boxes and items are candidates). A top-k query in such ...
Boaz Patt-Shamir, Allon Shafrir
CIRA
2007
IEEE
104views Robotics» more  CIRA 2007»
14 years 4 months ago
Towards a Sensor Classification Scheme for Robotic Manipulators
— This paper analyzes the signals captured during impacts and vibrations of a mechanical manipulator. To test the impacts, a flexible beam is clamped to the end-effector of a man...
Miguel F. M. Lima, José António Tenr...
ICRA
2005
IEEE
118views Robotics» more  ICRA 2005»
14 years 3 months ago
Haptic Rendering of Topological Constraints to Users Manipulating Serial Virtual Linkages
— This paper presents an approach for haptic rendering of topological constraints to users operating serial virtual linkages. In the proposed approach, a haptic device controller...
Daniela Constantinescu, S. E. Salcudean, Elizabeth...