1278 search results - page 134 / 256 » The Complexity of Weighted Boolean |
COCO
2008
Springer
14 years 4 days ago
2008
Springer
![Approximation of Natural W[P]-Complete Minimisation Problems Is Hard](https://www.sciweavers.org/files/imagecache/thumbnail/default/content.jpg "Approximation of Natural W[P]-Complete Minimisation Problems Is Hard")
We prove that the weighted monotone circuit satisfiability problem has no fixed-parameter tractable approximation algorithm with constant or polylogarithmic approximation ratio un...
CCE
2006
13 years 10 months ago
2006
The measurement and control of polymerization reactors is very challenging due to the complexity of the physical mechanisms and polymerization kinetics. In these reactors many imp...
NCA
2006
IEEE
13 years 10 months ago
2006
IEEE
The use of multilayer perceptrons (MLP) with threshold functions (binary step function activations) greatly reduces the complexity of the hardware implementation of neural networks...
ECCC
2000
13 years 10 months ago
2000
This article initiates a rigorous theoretical analysis of the computational power of circuits that employ modules for computing winner-take-all. Computational models that involve ...
PE
2007
Springer
13 years 9 months ago
2007
Springer
To develop simple traffic engineering rules for the downlink of a cellular system using Proportional Fairness (PF) scheduling, we study the “strict” and “approximate” ins...