10988 search results - page 188 / 2198 » Algorithmic Folding Complexity |
124
Voted
CORR
2002
Springer
15 years 3 months ago
2002
Springer
The Inductive Logic Programming community has considered proof-complexity and model-complexity, but, until recently, size-complexity has received little attention. Recently a chal...
206
Voted
ALDT
2011
Springer
14 years 3 months ago
2011
Springer
Abstract. We develop a Bayesian approach to concept learning for crowdsourcing applications. A probabilistic belief over possible concept definitions is maintained and updated acc...
136
Voted
LATA
2012
Springer
13 years 11 months ago
2012
Springer
We investigate the application of Courcelle’s Theorem and the logspace version of Elberfeld et al. in the context of the implication problem for propositional sets of formulae, t...
143
click to vote
ISSAC
2009
Springer
15 years 10 months ago
2009
Springer
We address complexity issues for linear differential equations in characteristic p > 0: resolution and computation of the p-curvature. For these tasks, our main focus is on al...
113
Voted
AIPS
2000
15 years 5 months ago
2000
The paper takes a fresh look at algorithms for maximizing expected utility over a set of policies, that is, a set of possible ways of reacting to observations about an uncertain s...