236 search results - page 39 / 48 » Learning How to Propagate Using Random Probing |
JAIR
2007
13 years 7 months ago
2007
Exact Max-SAT solvers, compared with SAT solvers, apply little inference at each node of the proof tree. Commonly used SAT inference rules like unit propagation produce a simpliï¬...
SIGMETRICS
2008
ACM
13 years 7 months ago
2008
ACM
Traditional performance models are too brittle to be relied on for continuous capacity planning and performance debugging in many computer systems. Simply put, a brittle model is ...
CVPR
2010
IEEE
14 years 4 months ago
2010
IEEE
Markov random fields (MRFs) are popular and generic probabilistic models of prior knowledge in low-level vision. Yet their generative properties are rarely examined, while applica...
BMCBI
2006
13 years 7 months ago
2006
Background: Supervised learning for classification of cancer employs a set of design examples to learn how to discriminate between tumors. In practice it is crucial to confirm tha...
JUCS
2008
13 years 7 months ago
2008
: Search engines--"web dragons"--are the portals through which we access society's treasure trove of information. They do not publish the algorithms they use to sort...