2978 search results - page 120 / 596 » Operations Research |
130
click to vote
CPAIOR
2006
Springer
15 years 5 months ago
2006
Springer
As many real-world problems involve user preferences, costs, or probabilities, constraint satisfaction has been extended to optimization by generalizing hard constraints to soft co...
154
Voted
CPAIOR
2008
Springer
15 years 5 months ago
2008
Springer
The one-step anticipatory algorithm (1s-AA) is an online algorithm making decisions under uncertainty by ignoring future non-anticipativity constraints. It makes near-optimal decis...
127
click to vote
CPAIOR
2008
Springer
15 years 5 months ago
2008
Springer
We consider the problem of estimating the model count (number of solutions) of Boolean formulas, and present two techniques that compute estimates of these counts, as well as eith...
127
click to vote
CPAIOR
2008
Springer
15 years 5 months ago
2008
Springer
Solution-Guided Multi-Point Constructive Search (SGMPCS) is a complete, constructive search technique that has been shown to out-perform standard constructive search techniques on ...
140
click to vote
CPAIOR
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. The stochastic satisfiability modulo theories (SSMT) problem is a generalization of the SMT problem on existential and randomized (aka. stochastic) quantification over di...