4328 search results - page 279 / 866 » A New Kind of Science |
176
click to vote
STOC
2003
ACM
16 years 7 months ago
2003
ACM
We consider a fundamental problem in computational learning theory: learning an arbitrary Boolean function which depends on an unknown set of k out of n Boolean variables. We give...
186
click to vote
SOFSEM
2010
Springer
16 years 3 months ago
2010
Springer
Abstract. The first part of this paper presents a new approach for automatically proving nontermination of string rewrite systems. We encode rewrite sequences as propositional for...
176
click to vote
SOFSEM
2009
Springer
16 years 3 months ago
2009
Springer
Abstract. Rewriting is the underlying evaluation mechanism of functional programming languages. Therefore, termination analysis of term rewrite systems (TRSs) is an important techn...
206
click to vote
CSCW
2010
ACM
16 years 1 months ago
2010
ACM
This paper builds on earlier CSCW studies of domestic technologies, looking at the frequent maintenance required by new security technologies that households are adopting to provi...
154
click to vote
SIGCSE
2010
ACM
16 years 1 months ago
2010
ACM
Topics in the field of Web Information Retrieval (IR) and web search are slowly being introduced at the undergraduate level. In this paper, we show how the curriculum for a new u...