An oscillating algorithm for variable ordering in binary decision diagram
Mohamed Taher; Ashraf Salem; Hani Mahdi 0001; A. Wahdan;
An oscillating algorithm for variable ordering in binary decision diagram
In this paper we present a novel heuristic for improving the variable order computation in the binary decision diagram. The proposed algorithm uses two way swapping and it oscillates forward and backward to minimize the number of cycles needed to get the best order. The validity of the proposed approach has been shown using ISCAS 85 benchmarks.
- Ain Shams University Egypt
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).1 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
selected citations
Citations provided by BIP!
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
Citations provided by BIP!popularityPopularity provided by BIP!
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
Popularity provided by BIP! 1
Average
Average
Average
This action will publish the selected files and record in Zenodo. Are you sure you want to proceed?