B Hayes, JA Shah - Proceedings of the 2017 ACM/IEEE international …, 2017 - dl.acm.org
Shared expectations and mutual understanding are critical facets of teamwork. Achieving these in human-robot collaborative contexts can be especially challenging, as humans and …
C Umans, T Villa… - IEEE Transactions on …, 2006 - ieeexplore.ieee.org
The complexity of two-level logic minimization is a topic of interest to both computer-aided design (CAD) specialists and computer science theoreticians. In the logic synthesis …
A Biere, M Heule, H van Maaren - 2009 - books.google.com
“Satisfiability (SAT) related topics have attracted researchers from various disciplines: logic, applied areas such as planning, scheduling, operations research and combinatorial …
Written by prominent experts in the field, this monograph provides the first comprehensive, unified presentation of the structural, algorithmic and applied aspects of the theory of …
Research on the complexity of Boolean functions has a more than fifty-year-old history. For a long time, research has been focused on circuits and the circuit complexity of Boolean …
This book provides broad and comprehensive coverage of the entire EDA flow. EDA/VLSI practitioners and researchers in need of fluency in an" adjacent" field will find this an …
N Gorji, S Rubin - Proceedings of the AAAI Conference on Artificial …, 2022 - ojs.aaai.org
Recent work has unveiled a theory for reasoning about the decisions made by binary classifiers: a classifier describes a Boolean function, and the reasons behind an instance …
For someone with a hammer the whole world looks like a nail. Within the last 10-13 years Binar· y Decision Diagmms (BDDs) have become the state-of-the-art data structure in VLSI …
Over the years, the fundamentals of VLSI technology have evolved to include a wide range of topics and a broad range of practices. To encompass such a vast amount of knowledge …