95 search results - page 19 / 19 » On Notions of Completeness Weaker than Kripke Completeness |
ML
2000
ACM
14 years 11 months ago
2000
ACM
Existing methods for exploiting awed domain theories depend on the use of a su ciently large set of training examples for diagnosing and repairing aws in the theory. In this paper,...
104
Voted
INTERACTIONS
2010
14 years 10 months ago
2010
s on Human Factors in Computing Systems. CHI ‘07. New York: ACM, 2007. university environment at scale, with structure, and with rigor. The notion of studio culture and learning ...
TCS
2010
14 years 10 months ago
2010
We give a new construction of strongly aperiodic set of tiles in H2 , exhibiting a kind of hierarchical structure, simplifying the central framework of Margenstern’s proof that t...
114
Voted
WAOA
2010
Springer
14 years 9 months ago
2010
Springer
The past few years have witnessed a number of interesting online algorithms for deadline scheduling in the dynamic speed scaling model (in which a processor can vary its speed to ...
114
click to vote
TCS
2011
14 years 6 months ago
2011
Let F be a cellular automaton (CA). This paper establishes necessary conditions for F in order to be intrinsically universal. The central idea is to consider the communication com...