537 search results - page 6 / 108 » A new upper bound for 3-SAT |
JGT
2006
15 years 1 months ago
2006
EJC
1998
15 years 1 months ago
1998
86
Voted
CP
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. Finding feasible points for which the proof succeeds is a critical issue in safe Branch and Bound algorithms which handle continuous problems. In this paper, we introduce...
105
click to vote
ICML
2005
IEEE
16 years 2 months ago
2005
IEEE
MDPs are an attractive formalization for planning, but realistic problems often have intractably large state spaces. When we only need a partial policy to get from a fixed start s...
109
click to vote
TIT
2002
15 years 1 months ago
2002
Let ( ) denote the maximum possible number of codewords in a binary code of length and minimum Hamming distance . For large values of , the best known upper bound, for fixed , is t...