Sciweavers

255 search results - page 26 / 51
» Generalizing Consistency and other Constraint Properties to ...
Sort
View
87
Voted
RTSS
1998
IEEE
15 years 2 months ago
Statistical Rate Monotonic Scheduling
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...
Alia Atlas, Azer Bestavros
APAL
2004
78views more  APAL 2004»
14 years 10 months ago
Ternary relations and relevant semantics
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...
Robert K. Meyer
78
Voted
AAAI
2006
14 years 11 months ago
Model Counting: A New Strategy for Obtaining Good Bounds
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...
Carla P. Gomes, Ashish Sabharwal, Bart Selman
VL
1992
IEEE
163views Visual Languages» more  VL 1992»
15 years 2 months ago
The Conversion of Diagrams to Knowledge Bases
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. ...
Robert P. Futrelle
ICML
2010
IEEE
14 years 11 months ago
Non-Local Contrastive Objectives
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...
David Vickrey, Cliff Chiung-Yu Lin, Daphne Koller