13603 search results - page 298 / 2721 » On the Complexity of Computing Treelength |
160
Voted
EWCBR
2006
Springer
15 years 9 months ago
2006
Springer
In this paper we present TransUCP, a general framework for transformational analogy. Using our framework we demonstrate that transformational analogy does not meet a crucial condit...
150
click to vote
COCOON
2008
Springer
15 years 8 months ago
2008
Springer
We analyze the complexity of equilibria problems for a class of strategic zero-sum games, called Angel-Daemon games. Those games were introduced to asses the goodness of a web or g...
173
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...
167
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
Voted
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...