522 search results - page 46 / 105 » On the Hardness of the Noncommutative Determinant |
ARITH
2001
IEEE
13 years 11 months ago
2001
IEEE
This paper demonstrates the advantages of using on-line arithmetic for traditional and advanced detection algorithms for communication systems. Detection is one of the core comput...
CISIS
2010
IEEE
13 years 11 months ago
2010
IEEE
— Production automation systems consist of many entities (like robots and shuttles) that interact in complex ways to provide the overall system functionality like product assembl...
DAC
2010
ACM
2010
ACM
A probabilistic and energy-efficient scheduling approach for online application in real-time systems
13 years 11 months ago
This work considers the problem of minimizing the power consumption for real-time scheduling on processors with discrete operating modes. We provide a model for determining the ex...
AAAI
2008
13 years 10 months ago
2008
In a yes/no voting game, a set of voters must determine whether to accept or reject a given alternative. Weighted voting games are a well-studied subclass of yes/no voting games, ...
AAAI
2008
13 years 10 months ago
2008
The study of random instances of NP complete and coNP complete problems has had much impact on our understanding of the nature of hard problems. In this work, we initiate an effor...