Sciweavers

4255 search results - page 215 / 851
» On Learning Boolean Functions
Sort
View
CORR
2008
Springer
113views Education» more  CORR 2008»
15 years 6 months ago
Generalized Modal Satisfiability
It is well-known that modal satisfiability is PSPACE-complete [Lad77]. However, the complexity may decrease if we restrict the set of propositional operators used. Note that there ...
Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor
JSW
2008
105views more  JSW 2008»
15 years 6 months ago
Representing Procedural Logic in XML
Extensible Markup Language (XML) is a powerful tool used for describing structured documents and exchanging standardized data files over the Internet. This article describes how us...
Albert D. Bethke
JSYML
2006
85views more  JSYML 2006»
15 years 6 months ago
An alternative semantics for quantified relevant logic
The quantified relevant logic RQ is given a new semantics in which a formula xA is true when there is some true proposition that implies all x-instantiations of A. Formulae are mo...
Robert Goldblatt, Edwin D. Mares
ET
2007
123views more  ET 2007»
15 years 6 months ago
Defect-tolerant Logic with Nanoscale Crossbar Circuits
Crossbar architectures are one approach to molecular electronic circuits for memory and logic applications. However, currently feasible manufacturing technologies introduce numero...
Tad Hogg, Greg Snider
NC
2006
116views Neural Networks» more  NC 2006»
15 years 6 months ago
Automated Design and Programming of a Microfluidic DNA Computer
Previously, we described ways to implement the functions AND and OR in a DNA computer consisting of microreactors with attached heating elements that control annealing of DNA. Base...
Michael S. Livstone, Ron Weiss, Laura F. Landweber