963 search results - page 153 / 193 » On Computation of Performance Bounds of Optimal Index Assign... |
ICML
2006
IEEE
15 years 10 months ago
2006
IEEE
For a Markov Decision Process with finite state (size S) and action spaces (size A per state), we propose a new algorithm--Delayed Q-Learning. We prove it is PAC, achieving near o...
100
click to vote
CP
2000
Springer
15 years 2 months ago
2000
Springer
Abstract. This paper evaluates the power of a new scheme that generates search heuristics mechanically. This approach was presented and evaluated rst in the context of optimization...
35
Voted
CORR
2008
Springer
14 years 9 months ago
2008
Springer
The Karmarkar-Karp differencing algorithm is the best known polynomial time heuristic for the number partitioning problem, fundamental in both theoretical computer science and stat...
88
Voted
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
In this paper, a new adaptive beamforming algorithm with joint robustness against covariance matrix uncertainty as well as steering vector mismatch is proposed. First, the theoret...
RTCSA
2003
IEEE
15 years 3 months ago
2003
IEEE
Network of workstation (NOW) is a cost-effective alternative to massively parallel supercomputers. As commercially available off-theshelf processors become cheaper and faster, it...