537 search results - page 38 / 108 » A new upper bound for 3-SAT |
TRANSCI
2010
13 years 6 months ago
2010
We propose a new method to compute bid prices in network revenue management problems. The novel aspect of our method is that it naturally provides dynamic bid prices that depend o...
AAAI
1997
13 years 9 months ago
1997
Partially observable Markov decision processes (POMDPs) allow one to model complex dynamic decision or control problems that include both action outcome uncertainty and imperfect ...
TVLSI
1998
13 years 8 months ago
1998
Abstract—Pseudoexhaustive testing involves applying all possible input patterns to the individual output cones of a combinational circuit. Based on our new algebraic results, we ...
TIT
2011
13 years 3 months ago
2011
— This paper presents new lower and upper bounds for the compression rate of binary prefix codes optimized over memoryless sources according to various nonlinear codeword length...
TCC
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. We establish new lower bounds and impossibility results for noninteractive zero-knowledge proofs and arguments with set-up assumptions. – For the common random string m...