486 search results - page 44 / 98 » Improved upper bounds for 3-SAT |
102
click to vote
VTS
2006
IEEE
15 years 3 months ago
2006
IEEE
This paper presents an improved method to accurately estimate signal probabilities using ordered partial decision diagrams (OPDDs) [Kodavarti 93] for partial representation of the...
AAAI
2006
14 years 11 months ago
2006
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...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
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...
DAM
2006
14 years 9 months ago
2006
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...
DM
2002
14 years 9 months ago
2002
A star forest of a graph G is a spanning subgraph of G in which each component is a star. The minimum number of edges required to guarantee that an arbitrary graph, or a bipartite...