Sciweavers

687 search results - page 18 / 138
» On The Complexity of Manipulating Elections
Sort
View
SSS
2010
Springer
158views Control Systems» more  SSS 2010»
13 years 6 months ago
Low Memory Distributed Protocols for 2-Coloring
In this paper we present new distributed protocols to color even rings and general bipartite graphs. Our motivation is to provide algorithmic explanation for human subject experime...
Amos Israeli, Mathew D. McCubbins, Ramamohan Patur...
JDWM
2008
120views more  JDWM 2008»
13 years 7 months ago
Algebraic and Graphic Languages for OLAP Manipulations
This article deals with multidimensional analyses. Analyzed data are designed according to a conceptual model as a constellation of facts and dimensions, which are composed of mul...
Franck Ravat, Olivier Teste, Ronan Tournier, Gille...
ICRA
2005
IEEE
86views Robotics» more  ICRA 2005»
14 years 1 months ago
A New Perspective on O(n) Mass-Matrix Inversion for Serial Revolute Manipulators
– This paper describes a new algorithm for the efficient mass-matrix inversion of serial manipulators. Whereas several well-known O(n) algorithms already exist, our presentation ...
Kiju Lee, Gregory S. Chirikjian
AAAI
2010
13 years 9 months ago
Compilation Complexity of Common Voting Rules
In computational social choice, one important problem is to take the votes of a subelectorate (subset of the voters), and summarize them using a small number of bits. This needs t...
Lirong Xia, Vincent Conitzer
ICRA
2006
IEEE
93views Robotics» more  ICRA 2006»
14 years 1 months ago
Motion Planning for a Class of Planar Closed-chain Manipulators
— We study the motion planning problem for planar star-shaped manipulators. These manipulators are formed by joining k “legs” to a common point (like the thorax of an insect)...
Guanfeng Liu, Jeffrey C. Trinkle, N. Shvalb