45 citations · 45 across the 1 of their papers we have counts for
4 papers
Efficient Solution of Boolean Satisfiability Problems with Digital MemComputing
S. R. B. Bearden, Y. R. Pei, M. Di Ventra
Boolean satisfiability is a propositional logic problem of interest in multiple fields, e.g., physics, mathematics, and computer science. Beyond a field of research, instances of t…
Mode-Assisted Unsupervised Learning of Restricted Boltzmann Machines
Haik Manukian, Yan Ru Pei, Sean R. B. Bearden +1
Restricted Boltzmann machines (RBMs) are a powerful class of generative models, but their training requires computing a gradient that, unlike supervised backpropagation on typical…
The Optimal Deterrence of Crime: A Focus on the Time Preference of DWI Offenders
Yuqing Wang, Yan Ru Pei
We develop a general model for finding the optimal penal strategy based on the behavioral traits of the offenders. We focus on how the discount rate (level of time discounting) aff…
Generating Weighted MAX-2-SAT Instances of Tunable Difficulty with Frustrated Loops
Yan Ru Pei, Haik Manukian, Massimiliano Di Ventra
Many optimization problems can be cast into the maximum satisfiability (MAX-SAT) form, and many solvers have been developed for tackling such problems. To evaluate a MAX-SAT solver…