522 search results - page 8 / 105 » On the Hardness of the Noncommutative Determinant |
WINE
2005
Springer
14 years 1 months ago
2005
Springer
We study the complexity issues for Walrasian equilibrium in a special case of combinatorial auction, called single-minded auction, in which every participant is interested in only ...
ECRTS
2002
IEEE
14 years 25 days ago
2002
IEEE
For priority based buses such as CAN, worst case response time analysis is able to determine whether messages always meet their deadlines. This can include system models with boun...
ISSTA
2006
ACM
14 years 1 months ago
2006
ACM
Finite-state verification techniques are often hampered by the stateexplosion problem. One proposed approach for addressing this problem is assume-guarantee reasoning. Using rece...
AI
2006
Springer
13 years 8 months ago
2006
Springer
This article presents and analyzes algorithms that systematically generate random Bayesian networks of varying difficulty levels, with respect to inference using tree clustering. ...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
We study the complexity of influencing elections through bribery: How computationally complex is it for an external actor to determine whether by paying certain voters to change t...