7106 search results - page 891 / 1422 » Restricted Complexity, General Complexity |
202
click to vote
AIPS
2003
15 years 8 months ago
2003
Planning in nondeterministic domains with temporally extended goals under partial observability is one of the most challenging problems in planning. Subsets of this problem have b...
193
click to vote
COGSCI
2008
15 years 7 months ago
2008
How children go about learning the general regularities that govern language, as well as keeping track of the exceptions to them, remains one of the challenging open questions in ...
191
click to vote
CSDA
2006
15 years 7 months ago
2006
We explore different approaches for performing hypothesis tests on the shape of a mean function by developing general methodologies both, for the often assumed, i.i.d. error struc...
234
click to vote
KDD
2010
ACM
15 years 5 months ago
2010
ACM
Scalable similarity search is the core of many large scale learning or data mining applications. Recently, many research results demonstrate that one promising approach is creatin...
270
click to vote
ECCC
2011
15 years 2 months ago
2011
Polynomial identity testing (PIT) problem is known to be challenging even for constant depth arithmetic circuits. In this work, we study the complexity of two special but natural ...