Search Results for author:
Found 5 papers, 0 papers with code
Efficient Solution of Boolean Satisfiability Problems with Digital MemComputing
It is the decision problem of determining whether a Boolean formula has a satisfying assignment, believed to require exponentially growing time for an algorithm to solve for the worst-case instances.
On the validity of memristor modeling in the neural network literature
An analysis of the literature shows that there are two types of non-memristive models that have been widely used in the modeling of so-called "memristive" neural networks.
A Memcomputing Pascaline
The original Pascaline was a mechanical calculator able to sum and subtract integers.
Memcomputing and Swarm Intelligence
By employing appropriate memristive elements one can demonstrate an almost one-to-one correspondence between memcomputing and ant colony optimization approaches.
Memcapacitive neural networks
We show that memcapacitive (memory capacitive) systems can be used as synapses in artificial neural networks.
