522 search results - page 22 / 105 » On the Hardness of the Noncommutative Determinant |
IJCAI
1997
13 years 9 months ago
1997
Planning for real-time applications involves decisions not only about what actions to take in what states to progress toward achieving goals (the traditional decision problem face...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
In this paper, a method for efficient scheduling to obtain optimum job throughput in a distributed campus grid environment is presented; Traditional job schedulers determine job s...
ALMOB
2006
13 years 8 months ago
2006
The String Barcoding (SBC) problem, introduced by Rash and Gusfield (RECOMB, 2002), consists in finding a minimum set of substrings that can be used to distinguish between all mem...
PAMI
2002
13 years 7 months ago
2002
In this article, we evaluate the performance of three clustering algorithms, hard K-Means, single linkage, and a simulated annealing (SA) based technique, in conjunction with four ...
TSP
2010
13 years 2 months ago
2010
A random beamforming scheme for the Gaussian MIMO broadcast channel with channel quality feedback is investigated and extended. Considering the case where the receivers each have r...