Sciweavers

971 search results - page 23 / 195
» Approximate Satisfiability and Equivalence
Sort
View
CP
2009
Springer
16 years 7 months ago
Approximating Weighted Max-SAT Problems by Compensating for Relaxations
We introduce a new approach to approximating weighted Max-SAT problems that is based on simplifying a given instance, and then tightening the approximation. First, we relax its str...
Arthur Choi, Trevor Standley, Adnan Darwiche
WADS
2009
Springer
274views Algorithms» more  WADS 2009»
16 years 1 months ago
Approximating Transitive Reductions for Directed Networks
Abstract. We consider minimum equivalent digraph problem, its maximum optimization variant and some non-trivial extensions of these two types of problems motivated by biological an...
Piotr Berman, Bhaskar DasGupta, Marek Karpinski
TWC
2011
231views more  TWC 2011»
15 years 1 months ago
An Accurate Closed-Form Approximation of the Distributed MIMO Outage Probability
— The mutual information (MI) of multiple-input multiple-output (MIMO) system over Rayleigh fading channel is known to asymptotically follow a normal probability distribution. In...
Fabien Heliot, Reza Hoshyar, Rahim Tafazolli
ENTCS
2006
118views more  ENTCS 2006»
15 years 6 months ago
Domain Theoretic Solutions of Initial Value Problems for Unbounded Vector Fields
This paper extends the domain theoretic method for solving initial value problems, described in [8], to unbounded vector fields. Based on a sequence of approximations of the vecto...
Abbas Edalat, Dirk Pattinson
IJBC
2002
109views more  IJBC 2002»
15 years 6 months ago
Cnn Dynamics represents a Broader Class than PDES
The relationship between Cellular Nonlinear Networks (CNNs) and Partial Differential Equations (PDEs) is investigated. The equivalence between discrete-space CNN models and contin...
Marco Gilli, Tamás Roska, Leon O. Chua, Pie...