17329 search results - page 186 / 3466 » Improved non-approximability results |
ICML
2007
IEEE
14 years 11 months ago
2007
IEEE
Reinforcement learning algorithms can become unstable when combined with linear function approximation. Algorithms that minimize the mean-square Bellman error are guaranteed to co...
DCC
2008
IEEE
14 years 9 months ago
2008
IEEE
We propose an algorithm which is an improved version of the Kabatiansky-Tavernier list decoding algorithm for the second order binary Reed-Muller code RM(2, m), of length n = 2m , ...
SODA
2010
ACM
14 years 7 months ago
2010
ACM
We design and analyze an on-line reordering buffer management algorithm with improved O log k log log k competitive ratio for non-uniform costs, where k is the buffer size. This i...
ICCAD
2006
IEEE
14 years 7 months ago
2006
IEEE
The paper explores several ways to improve the speed and capacity of combinational equivalence checking based on Boolean satisfiability (SAT). State-of-the-art methods use simulat...
GLVLSI
2009
IEEE
14 years 4 months ago
2009
IEEE
Based on the insertion of internal and external redundant wires into L-type and U-type wires, an efficient two-phase reliability-driven insertion algorithm is proposed to insert r...