CPAIOR
2008
Springer
13 years 6 months ago
2008
Springer
CPAIOR
2008
Springer
13 years 6 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...
CPAIOR
2008
Springer
13 years 6 months ago
2008
Springer
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
CPAIOR
2008
Springer
13 years 6 months ago
2008
Springer
Anticipatory algorithms for online stochastic optimization have been shown very effective in a variety of areas, including logistics, reservation systems, and scheduling. For such ...
CPAIOR
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. This paper proposes to use local search inside filtering algorithms of combinatorial structures for which achieving a desired level of consistency is too computationally ...
CPAIOR
2008
Springer
13 years 6 months ago
2008
Springer
CPAIOR
2008
Springer
13 years 6 months ago
2008
Springer
CPAIOR
2008
Springer
13 years 6 months ago
2008
Springer
A domino portrait is an approximation of an image using a given number of sets of dominoes. This problem was first stated in
CPAIOR
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. This paper furthers the recent investigation of search heuristics based on solution counting information, by proposing and evaluating algorithms to compute solution densi...
CPAIOR
2008
Springer
13 years 6 months ago
2008
Springer