13603 search results - page 154 / 2721 » On the Computational Complexity of Cut-Reduction |
174
click to vote
DAGSTUHL
2006
15 years 7 months ago
2006
We consider the computational complexity of producing the best possible offspring in a crossover, given two solutions of the parents. The crossover operators are studied on the cla...
168
click to vote
IJCAI
2003
15 years 7 months ago
2003
Many real life optimization problems contain both hard and soft constraints, as well as qualitative conditional preferences. However, there is no single formalism to specify all t...
158
click to vote
ICASSP
2010
IEEE
15 years 6 months ago
2010
IEEE
Most speech enhancement algorithms heavily depend on the noise power spectral density (PSD). Because this quantity is unknown in practice, estimation from the noisy data is necess...
165
click to vote
AUTOMATICA
2008
15 years 6 months ago
2008
This paper focuses on the NP-hard problem of reducing the complexity of piecewise polyhedral systems (e.g. polyhedral piecewise affine (PWA) systems). The results are fourfold. Fi...
185
click to vote
CC
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. We study the complexity of the isomorphism and automorphism problems for finite rings. We show that both integer factorization and graph isomorphism reduce to the problem...