130 search results - page 25 / 26 » A New Upper Bound for Max-2-Sat: A Graph-Theoretic Approach |
SAC
2006
ACM
13 years 11 months ago
2006
ACM
: In chip design, one of the main objectives is to decrease its clock cycle; however, the existing approaches to timing analysis under uncertainty are based on fundamentally restri...
AIPS
2006
13 years 6 months ago
2006
We present a new algorithm for conformant probabilistic planning, which for a given horizon produces a plan that maximizes the probability of success under quantified uncertainty ...
STOC
2004
ACM
14 years 5 months ago
2004
ACM
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
FSE
2007
Springer
13 years 11 months ago
2007
Springer
We investigate the security of n-bit to m-bit vectorial Boolean functions in stream ciphers. Such stream ciphers have higher throughput than those using single-bit output Boolean f...
STOC
2005
ACM
14 years 5 months ago
2005
ACM
The Write-All problem for an asynchronous shared-memory system has the objective for the processes to update the contents of a set of shared registers, while minimizing the mber o...