Statistical Rate Monotonic Scheduling (SRMS) is a generalization of the classical RMS results of Liu and Layland [10] for periodic tasks with highly variable execution times and s...
Modus ponens provides the central theme. There are laws, of the form A C. A logic (or other theory) L collects such laws. Any datum A (or theory T incorporating such data) provid...
Model counting is the classical problem of computing the number of solutions of a given propositional formula. It vastly generalizes the NP-complete problem of propositional satis...
If future electronic documents are to be truly useful, we must devise ways to automatically turn them into knowledgebases. In particular, we must be able to do this for diagrams. ...
Pseudo-likelihood and contrastive divergence are two well-known examples of contrastive methods. These algorithms trade off the probability of the correct label with the probabili...