Creator | Title | Description | Subject | Date | ||
---|---|---|---|---|---|---|
1 | Perschon, Cole | Structural rounding on a parameterized graph class using heuristics | Structural rounding is a framework for approximating NP-hard optimization problems on graphs near structured classes [10]. It has previously been empirically shown to outperform standard 2-approximations for VERTEX COVER on near-bipartite graphs [21]. Though promising, it is unclear if these finding... | 2021 | ||
2 | Campbell, Andrew | Asynchronous distributed }OT-Enabled customer characterization in distrubtion networks: theory and hardware implementation | This work proposes and implements an asynchronous distributed IoT (Internet of Things)-enabled customer characterization framework to classify customers' load consumption behaviors in electric distribution networks. More specifically, the proposed framework enables robust fully distributed clusterin... | 2021 | ||
3 | Geary, Thatcher | Chop-sat in NON-Euclidean Geometry | This study explores methods of applying Non-Euclidean Geometry to the Boolean Satisfiability Problem (SAT). When presented with a knowledge base in Conjunctive Normal Form (CNF) with n atoms, it can be represented as an n-dimensional hypercube, where each corner corresponds to a unique combination o... | 2024 |