Sciweavers

539 search results - page 52 / 108
» An Improved Upper Bound for SAT
Sort
View
FOCS
2006
IEEE
15 years 5 months ago
New Limits on Fault-Tolerant Quantum Computation
We show that quantum circuits cannot be made faulttolerant against a depolarizing noise level of ˆθ = (6 − 2 √ 2)/7 ≈ 45%, thereby improving on a previous bound of 50% (du...
Harry Buhrman, Richard Cleve, Monique Laurent, Noa...
VTS
2006
IEEE
98views Hardware» more  VTS 2006»
15 years 5 months ago
Iterative OPDD Based Signal Probability Calculation
This paper presents an improved method to accurately estimate signal probabilities using ordered partial decision diagrams (OPDDs) [Kodavarti 93] for partial representation of the...
Avijit Dutta, Nur A. Touba
AAAI
2006
15 years 1 months ago
Focused Real-Time Dynamic Programming for MDPs: Squeezing More Out of a Heuristic
Real-time dynamic programming (RTDP) is a heuristic search algorithm for solving MDPs. We present a modified algorithm called Focused RTDP with several improvements. While RTDP ma...
Trey Smith, Reid G. Simmons
CORR
2008
Springer
100views Education» more  CORR 2008»
14 years 12 months ago
Lossy Source Transmission over the Relay Channel
Lossy transmission over a relay channel in which the relay has access to correlated side information is considered. First, a joint source-channel decode-and-forward scheme is propo...
Deniz Gündüz, Elza Erkip, Andrea J. Gold...
DAM
2006
78views more  DAM 2006»
14 years 12 months ago
Hybrid rounding techniques for knapsack problems
We address the classical knapsack problem and a variant in which an upper bound is imposed on the number of items that can be selected. We show that appropriate combinations of ro...
Monaldo Mastrolilli, Marcus Hutter