13784 search results - page 242 / 2757 » On Computing Functions with Uncertainty |
CVPR
2007
IEEE
14 years 11 months ago
2007
IEEE
The existing methods for offline training of cascade classifiers take a greedy search to optimize individual classifiers in the cascade, leading inefficient overall performance. W...
GECCO
2011
Springer
13 years 1 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)...
AAAI
2010
13 years 11 months ago
2010
The precise specification of reward functions for Markov decision processes (MDPs) is often extremely difficult, motivating research into both reward elicitation and the robust so...
SIGECOM
2010
ACM
14 years 2 months ago
2010
ACM
We analyze the complexity of computing pure strategy Nash equilibria (PSNE) in symmetric games with a fixed number of actions. We restrict ourselves to “compact” representati...
MFCS
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. A Solovay function is a computable upper bound g for prefixfree Kolmogorov complexity K that is nontrivial in the sense that g agrees with K, up to some additive constan...