522 search results - page 12 / 105 » On the Hardness of the Noncommutative Determinant |
AAAI
2012
11 years 10 months ago
2012
The complexity of the winner determination problem has been studied for almost all common voting rules. A notable exception, possibly caused by some confusion regarding its exact ...
MOBICOM
2012
ACM
11 years 10 months ago
2012
ACM
Access to relative location of nearby vehicles on the local roads or on the freeways is useful for providing critical alerts to the drivers, thereby enhancing their driving experi...
CIAC
2010
Springer
13 years 4 months ago
2010
Springer
We study the parameterized complexity of the problems of determining whether a graph contains a k-edge subgraph (k-vertex induced subgraph) that is a -graph for -graphs being one ...
CJ
2010
13 years 5 months ago
2010
Abstract. Semantics-based program analysis uses an abstract semantics of programs/systems to statically determine run-time properties. Classic examples from compiler technology inc...
RTCSA
2008
IEEE
14 years 2 months ago
2008
IEEE
Real-time systems are often designed using preemptive scheduling to guarantee the execution of high priority tasks. For multiple reasons there is a great interest in exploring non...