151 search results - page 7 / 31 » Handling Boolean A Boxes |
84
Voted
KI
2009
Springer
15 years 4 months ago
2009
Springer
Many practical optimization problems are constrained black boxes. Covariance Matrix Adaptation Evolution Strategies (CMA-ES) belong to the most successful black box optimization me...
87
Voted
IACR
2011
13 years 9 months ago
2011
Protocols for generic secure multi-party computation (MPC) come in two forms: they either represent the function being computed as a boolean circuit, or as an arithmetic circuit o...
SAS
2010
Springer
14 years 8 months ago
2010
Springer
c Abstraction for Intervals Using Boolean Formulae J¨org Brauer1 and Andy King2 1 Embedded Software Laboratory, RWTH Aachen University, Germany 2 Portcullis Computer Security, Pin...
81
Voted
CADE
2002
Springer
15 years 9 months ago
2002
Springer
The classical NP-complete problem of Boolean Satisfiability (SAT) has seen much interest in not just the theoretical computer science community, but also in areas where practical s...
79
Voted
CAV
2009
Springer
15 years 10 months ago
2009
Springer
We describe a Markov chain Monte Carlo (MCMC)-based algorithm for sampling solutions to mixed Boolean/integer constraint problems. The focus of this work differs in two points from...