46 search results - page 4 / 10 » Satisfiability Modulo the Theory of Costs: Foundations and A... |
113
click to vote
CAV
2009
Springer
16 years 2 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...
116
click to vote
ISM
2008
IEEE
15 years 8 months ago
2008
IEEE
Selective encryption is a new trend in content protection. It aims at reducing the amount of data to encrypt while achieving a sufficient and inexpensive security. This approach ...
127
click to vote
ECAI
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. Learning in the context of constraint solving is a technique by which previously unknown constraints are uncovered during search and used to speed up subsequent search. R...
111
click to vote
FORTE
2008
15 years 3 months ago
2008
Model programs represent transition systems that are used fy expected behavior of systems at a high level of abstraction. The main application area is application-level network pro...
121
click to vote
CAV
2009
Springer
15 years 5 months ago
2009
Springer
We consider the decision problem for quantifier-free formulas whose atoms are linear inequalities interpreted over the reals or rationals. This problem may be decided using satisf...