15033 search results - page 147 / 3007 » Complexity Theory and Algorithms |
123
Voted
ISLPED
2004
ACM
15 years 9 months ago
2004
ACM
Increasing demand for larger high-performance applications requires developing more complex systems with hundreds of processing cores on a single chip. To allow dynamic voltage sc...
141
click to vote
PIMRC
2008
IEEE
15 years 10 months ago
2008
IEEE
—We consider the Bayesian inference of a random Gaussian vector in a linear model with a random Gaussian matrix. We review two approaches to finding the MAP estimator for this m...
143
click to vote
DISOPT
2006
15 years 3 months ago
2006
We consider the multiple shift scheduling problem modelled as a covering problem. Such problems are characterized by a constraint matrix that has in every column blocks of consecu...
141
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
We consider two kinds of problems: the computation of polynomial and rational solutions of linear recurrences with coefficients that are polynomials with integer coefficients; ind...
127
click to vote
DAM
1999
15 years 3 months ago
1999
The definitions of four previously studied parameters related to total coverings and total matchings of graphs can be restricted, thereby obtaining eight parameters related to cov...