Back to Results
First PageMeta Content
APL programming language family / Array programming languages / Computer programming / Diagrams / Binary decision diagram / Model checking / APL / K / Reed-Muller expansion / Boolean algebra / Computing / Software engineering


Minimization of Average Path Length in BDDs by Variable Reordering Shinobu NAGAYAMA1 Alan MISHCHENKO2 Tsutomu SASAO1,3
Add to Reading List

Document Date: 2003-04-24 12:04:31

Open Document

File Size: 74,37 KB

Share Result on Facebook

City

Monterey / New Orleans / Cambridge / Sendai / a BDD / Yokohama / /

Company

M. I. Press / /

Continent

Asia / /

Country

Japan / United States / /

Facility

Kyushu Institute of Technology / /

IndustryTerm

published algorithm / minimization algorithm / proposed sifting algorithm / static ordering algorithm / variable reordering algorithm / proposed variable reordering algorithm / classical sifting algorithm / /

MarketIndex

MCNC / /

OperatingSystem

Linux / /

Organization

Takeda Foundation / Department of CSE / Japan Society for the Promotion of Science / Department of ECE / Department of EECS / Center for Microelectronic Systems / Kyushu Institute of Technology / UC Berkeley / Naval Postgraduate School / U.S. Securities and Exchange Commission / /

ProgrammingLanguage

APL / /

ProvinceOrState

Pennsylvania / Louisiana / California / Massachusetts / /

Technology

previously published algorithm / proposed algorithm / classical sifting algorithm / Linux / proposed sifting algorithm / reordering algorithm / The algorithm / variable reordering algorithm / sifting algorithm / swapping algorithm / simulation / APL minimization algorithm / Operating System / Graph-based algorithms / proposed variable reordering algorithm / static ordering algorithm / CAD / /

SocialTag