Sciweavers

374 search results - page 31 / 75
» sum 2010
Sort
View
GECCO
2010
Springer
156views Optimization» more  GECCO 2010»
14 years 1 months ago
Elementary landscape decomposition of the quadratic assignment problem
The Quadratic Assignment Problem (QAP) is a well-known NP-hard combinatorial optimization problem that is at the core of many real-world optimization problems. We prove that QAP c...
J. Francisco Chicano, Gabriel Luque, Enrique Alba
RTA
2010
Springer
14 years 1 months ago
Closing the Gap Between Runtime Complexity and Polytime Computability
In earlier work, we have shown that for confluent term rewrite systems (TRSs for short), innermost polynomial runtime complexity induces polytime computability of the functions de...
Martin Avanzini, Georg Moser
AAAI
2010
13 years 11 months ago
Sequential Incremental-Value Auctions
We study the distributed allocation of tasks to cooperating robots in real time, where each task has to be assigned to exactly one robot so that the sum of the latencies of all ta...
Xiaoming Zheng, Sven Koenig
ICASSP
2010
IEEE
13 years 10 months ago
Latent-variable decomposition based dereverberation of monaural and multi-channel signals
We present an algorithm to dereverberate single- and multi-channel audio recordings. The proposed algorithm models the magnitude spectrograms of clean audio signals as histograms ...
Rita Singh, Bhiksha Raj, Paris Smaragdis
ICASSP
2010
IEEE
13 years 10 months ago
Learning sparse systems at sub-Nyquist rates: A frequency-domain approach
We propose a novel algorithm for sparse system identification in the frequency domain. Key to our result is the observation that the Fourier transform of the sparse impulse respo...
Martin McCormick, Yue M. Lu, Martin Vetterli