ece.ucsb.edu

Bhattacharya – HW for Rapidly Solving High-order Optimization Problems

From the UCSB The Current article "Innovative Hardware for Rapidly Solving High-order Optimization Problems" The rise of AI, graphic processing, combinatorial optimization, and other data-intensive ...
IEEE

Analyzing the Impact of Fine-Tuning a Large Language Model on the 3-SAT Problem

Abstract: This paper investigates the feasibility of fine-tuning a large language model (LLM), specifically ChatGPT, to tackle the Boolean satisfiability problem (3-SAT), a well-known NP-complete ...
IEEE

Chameleon-SAT: An Adaptive Boolean Satisfiability Accelerator Using Mixed-Signal In-Memory Computing for Versatile SAT Problems

Abstract: Boolean satisfiability (SAT), the first proven nondeterministic polynominal-complete problem, is crucial in dataintensive applications. Different applications have a wide spectrum of SAT ...