236 search results - page 39 / 48 » Learning How to Propagate Using Random Probing |
110
click to vote
JAIR
2007
14 years 11 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
14 years 11 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 ...
103
click to vote
CVPR
2010
IEEE
15 years 8 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...
104
Voted
BMCBI
2006
14 years 11 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...
98
Voted
JUCS
2008
14 years 11 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...