522 search results - page 45 / 105 » On the Hardness of the Noncommutative Determinant |
RTSS
1997
IEEE
14 years 6 days ago
1997
IEEE
We present a method for providing response-time guarantees in Asynchronous Transfer Mode (ATM) networks. The method is based on traditional real-time CPU Response-Time Analysis (R...
FCT
2007
Springer
13 years 12 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...
ATAL
2006
Springer
13 years 11 months ago
2006
Springer
Preferences of a single agent are often partially ordered. For example, it may be hard to compare a novel with a biography. In such a situation, the agent may want the novel and t...
CIKM
2006
Springer
13 years 11 months ago
2006
Springer
In practical classification, there is often a mix of learnable and unlearnable classes and only a classifier above a minimum performance threshold can be deployed. This problem is...
FM
2006
Springer
13 years 11 months ago
2006
Springer
Symmetry reduction techniques can help to combat the state space explosion problem for model checking, but are restricted by the hard problem of determining equivalence of states d...