| Document Date: 2004-12-03 17:46:16
Open Document File Size: 190,42 KBShare Result on Facebook
Company Fujitsu / CNF / N. Saluja S. P. / MVSIS Group / Intel / / / Facility Microelectronics Center / EXTRA library / EECS University of California / / IndustryTerm don’tcare computation algorithm / binary networks / binary network / industrial tools / deterministic networks / classical algorithm / logic networks / large industrial networks / window construction algorithm / sub-network / nondeterministic multi-valued networks / multilevel network / non-deterministic multi-valued networks / multi-level networks / nondeterministic multi-valued network / same method to larger networks / multi-valued don’t-care computation algorithm / search algorithm / non-deterministic networks / / OperatingSystem Windows XP / / Organization UC Berkeley / University of California / Berkeley / Robert K. Brayton Department / Microelectronics Center of North Carolina / / Person Robert K. Brayton / A. Kuehlmann / V / Alan Mishchenko / / ProgrammingLanguage L / R / C++ / / ProvinceOrState North Carolina / / TVStation TFO / / Technology BDD-based algorithms / SAT-based don’tcare computation algorithm / RAM / search algorithm / window construction algorithm / windowing algorithm / corresponding BDD-based algorithm / classical algorithm / multi-valued don’t-care computation algorithm / simulation / CAD / / URL http /
SocialTag |
SAT-Based Complete Don’t-Care Computation for Network Optimization Alan Mishchenko and Robert K. Brayton Department of EECS University of California, Berkeley {alanmi, brayton}@eecs.berkeley.edu