2168 search results - page 40 / 434 » Randomized Algorithms and Complexity Theory |
123
Voted
AAAI
2008
15 years 4 months ago
2008
The study of random instances of NP complete and coNP complete problems has had much impact on our understanding of the nature of hard problems. In this work, we initiate an effor...
157
Voted
COCO
2009
Springer
15 years 9 months ago
2009
Springer
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...
130
Voted
CPAIOR
2008
Springer
15 years 4 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...
126
Voted
CORR
2006
Springer
15 years 2 months ago
2006
Springer
Internet search companies sell advertisement slots based on users' search queries via an auction. While there has been previous work on the auction process and its game-theor...
174
click to vote
GECCO
2011
Springer
14 years 6 months ago
2011
Springer
Computing unique input-output sequences (UIOs) from finite state machines (FSMs) is important for conformance testing in software engineering, where evolutionary algorithms (EAs)...