1241 search results - page 100 / 249 » Path-oriented random testing |
125
click to vote
CPAIOR
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. This work presents methods for processing a constraint satisfaction problem (CSP) formulated by an expression-based language, before the CSP is presented to a stochastic ...
121
click to vote
AIRS
2004
Springer
15 years 10 months ago
2004
Springer
Carrying out experiments in Information Retrieval is a heavy activity requiring fast tools to treat collections of significant size, and at the same time flexible tools to leave...
138
click to vote
SAT
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. Recently Schuler [17] presented a randomized algorithm that solves SAT in expected time at most 2n(1−1/ log2(2m)) up to a polynomial factor, where n and m are, respecti...
135
click to vote
AAAI
1997
15 years 6 months ago
1997
One of the important components of a local search strategy for satisfiability testing is the variable selection heuristic, which determines the next variable to be flipped. In a...
143
click to vote
SIAMJO
2008
15 years 4 months ago
2008
Stochastic dominance constraints allow a decision-maker to manage risk in an optimization setting by requiring their decision to yield a random outcome which stochastically domina...