427 search results - page 79 / 86 » A Graph Based Synthesis Algorithm for Solving CSPs |
131
Voted
CISS
2008
IEEE
15 years 9 months ago
2008
IEEE
— In this paper, we present a distributed algorithm for detecting redundancies in a sensor network with no location information. We demonstrate how, in the absence of localizatio...
104
Voted
ICALP
2007
Springer
15 years 8 months ago
2007
Springer
Register allocation is NP-complete in general but can be solved in linear time for straight-line programs where each variable has at most one definition point if the bank of regis...
98
Voted
DAC
2010
ACM
15 years 6 months ago
2010
ACM
In this paper we present a solver for Quantified Boolean Formulas (QBFs) which is based on And-Inverter Graphs (AIGs). We use a new quantifier elimination method for AIGs, which...
113
Voted
ACTA
2006
15 years 2 months ago
2006
Abstract Selectivity estimation of a boolean query based on frequent itemsets can be solved by describing the problem by a linear program. However, the number of variables in the e...
159
Voted
CORR
2011
Springer
14 years 6 months ago
2011
Springer
: The Bethe Permanent of a Non-Negative Matrix Pascal O. Vontobel HP Laboratories HPL-2011-116 Bethe approximation; Bethe permanent; graph cover; partition function; perfect ma...