283 search results - page 11 / 57 » Deterministic Polynomial Time Algorithms for Matrix Completi... |
FCT
2007
Springer
13 years 11 months ago
2007
Springer
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...
ICRA
1999
IEEE
13 years 11 months ago
1999
IEEE
Three fundamental problems in the study of grasping and dextrous manipulation with multifingered robotic hands are as follows. a) Given a robotic hand and a grasp characterized by ...
IPL
2002
13 years 7 months ago
2002
We study the problem of scheduling unit time tasks of two types on m parallel identical machines. For each type, given numbers of tasks are required to be completed by the specifi...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
We consider matrix groups, specified by a list of generators, over finite fields. The two most basic questions about such groups are membership in and the order of the group. Even...
ICRA
2007
IEEE
14 years 1 months ago
2007
IEEE
Abstract— For the multi-robot coverage problem deterministic deliberative as well as probabilistic approaches have been proposed. Whereas deterministic approaches usually provide...