Sciweavers

1278 search results - page 152 / 256
» The Complexity of Weighted Boolean
Sort
View
IJAR
2010
91views more  IJAR 2010»
13 years 9 months ago
Logical and algorithmic properties of stable conditional independence
The logical and algorithmic properties of stable conditional independence (CI) as an alternative structural representation of conditional independence information are investigated...
Mathias Niepert, Dirk Van Gucht, Marc Gyssens
CPAIOR
2010
Springer
13 years 8 months ago
Lazy Clause Generation: Combining the Power of SAT and CP (and MIP?) Solving
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
Peter J. Stuckey
GLOBECOM
2010
IEEE
13 years 8 months ago
A Tunnel-Aware Language for Network Packet Filtering
While in computer networks the number of possible protocol encapsulations is growing day after day, network administrators face ever increasing difficulties in selecting accurately...
Luigi Ciminiera, Marco Leogrande, Ju Liu, Fulvio R...
SPIN
2010
Springer
13 years 8 months ago
Efficient Explicit-State Model Checking on General Purpose Graphics Processors
We accelerate state space exploration for explicit-state model checking by executing complex operations on the graphics processing unit (GPU). In contrast to existing approaches en...
Stefan Edelkamp, Damian Sulewski
NC
2011
201views Neural Networks» more  NC 2011»
13 years 5 months ago
The computational power of membrane systems under tight uniformity conditions
We apply techniques from complexity theory to a model of biological cellular membranes known as membrane systems or P-systems. Like Boolean circuits, membrane systems are defined ...
Niall Murphy, Damien Woods