3172 search results - page 240 / 635 » On the Random-Self-Reducibility of Complete Sets |
162
click to vote
IJAC
2002
15 years 6 months ago
2002
Abstract. We discuss the computational complexity of several problems concerning subsets of an algebraic structure that generate the structure. We show that the problem of determin...
203
click to vote
JMLR
2002
15 years 6 months ago
2002
We examine the learning-curve sampling method, an approach for applying machinelearning algorithms to large data sets. The approach is based on the observation that the computatio...
199
click to vote
ATAL
2011
Springer
14 years 6 months ago
2011
Springer
Distributed systems can often be modeled as a collection of distributed (system) variables whose values are constrained by a set of constraints. In distributed multi-agent systems...
183
click to vote
KGC
1993
Springer
15 years 10 months ago
1993
Springer
We establish the complexity of decision problems associated with the nonmonotonic modal logic S4. We prove that the problem of existence of an S4-expansion for a given set A of pr...
154
click to vote
NIPS
2007
15 years 8 months ago
2007
We consider apprenticeship learning—learning from expert demonstrations—in the setting of large, complex domains. Past work in apprenticeship learning requires that the expert...