7930 search results - page 348 / 1586 » Greedy in Approximation Algorithms |
167
click to vote
AAIM
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. In an implicit combinatorial optimization problem, the constraints are not enumerated explicitly but rather stated implicitly through equations, other constraints or auxi...
160
click to vote
ICASSP
2008
IEEE
16 years 1 months ago
2008
IEEE
In this paper, we extend the cross-multiplicative transfer function (CMTF) approach for improved system identification in the shorttime Fourier transform (STFT) domain. The propo...
179
click to vote
WSC
2008
15 years 9 months ago
2008
Approximate dynamic programming is emerging as a powerful tool for certain classes of multistage stochastic, dynamic problems that arise in operations research. It has been applie...
195
click to vote
CP
2008
Springer
15 years 8 months ago
2008
Springer
In this paper, we describe a new algorithm for sampling solutions from a uniform distribution over the solutions of a constraint network. Our new algorithm improves upon the Sampli...
158
click to vote
AAAI
2006
15 years 8 months ago
2006
Active fusion is a process that purposively selects the most informative information from multiple sources as well as combines these information for achieving a reliable result ef...