Part of resolving the political redistricting stalemate, writes Professor Jamie Tucker-Foltz, is creating congressional maps that align with human intuition about fairness.
Abstract: In this paper, we present a novel MaxSAT-based technique to compute Maximum Probability Minimal Cut Sets (MPMCSs) in fault trees. We model the MPMCS problem as a Weighted Partial MaxSAT ...
A simple and efficient c++ KD-Tree implementation. This code was written when I was learning c++11. So I deliberately wrote it all in c++ style and used some c++11 characteristics, like smart pointer ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback