Sciweavers

2128 search results - page 22 / 426
» A general characterization of indulgence
Sort
View
AAAI
2008
14 years 1 months ago
Clause Learning Can Effectively P-Simulate General Propositional Resolution
Currently, the most effective complete SAT solvers are based on the DPLL algorithm augmented by clause learning. These solvers can handle many real-world problems from application...
Philipp Hertel, Fahiem Bacchus, Toniann Pitassi, A...
CORR
2007
Springer
128views Education» more  CORR 2007»
13 years 11 months ago
Equivalence of LP Relaxation and Max-Product for Weighted Matching in General Graphs
— Max-product belief propagation is a local, iterative algorithm to find the mode/MAP estimate of a probability distribution. While it has been successfully employed in a wide v...
Sujay Sanghavi
CORR
2010
Springer
93views Education» more  CORR 2010»
13 years 10 months ago
Generalized roof duality and bisubmodular functions
Consider a convex relaxation ^f of a pseudo-boolean function f. We say that the relaxation is totally half-integral if ^f(x) is a polyhedral function with halfintegral extreme poi...
Vladimir Kolmogorov
CORR
2010
Springer
102views Education» more  CORR 2010»
13 years 11 months ago
Outage Probability of General Ad Hoc Networks in the High-Reliability Regime
Outage probabilities in wireless networks depend on various factors: the node distribution, the MAC scheme, and the models for path loss, fading and transmission success. In prior ...
Riccardo Giacomelli, Radha Krishna Ganti, Martin H...
CORR
2010
Springer
126views Education» more  CORR 2010»
13 years 11 months ago
Fundamental Limits of Wideband Localization - Part I: A General Framework
The availability of positional information is of great importance in many commercial, public safety, and military applications. The coming years will see the emergence of locationa...
Yuan Shen, Moe Z. Win