Results 131 to 140 of about 20,200 (225)

Solving Boolean satisfiability problems with resistive content addressable memories

open access: yesnpj Unconventional Computing
Solving optimization problems is a highly demanding workload requiring high-performance computing systems. Optimization solvers are usually difficult to parallelize in conventional digital architectures, particularly when stochastic decisions are involved.
Giacomo Pedretti   +17 more
openaire   +2 more sources

Efficient optimization with higher-order ising machines. [PDF]

open access: yesNat Commun, 2023
Bybee C   +5 more
europepmc   +1 more source

Synthesising Programs with Non-trivial Constants. [PDF]

open access: yesJ Autom Reason, 2023
Abate A   +8 more
europepmc   +1 more source

Solving Boolean Satisfiability Problems Using A Hypergraph-based Probabilistic Computer [PDF]

open access: green
Yihan He   +9 more
openalex   +1 more source

Home - About - Disclaimer - Privacy