S. Minato and S. Ishihara. Streaming BDD manipulation for large-scale combinatorial problems. In Design, Automation and Test in Europe, pages 224--228, 2001. Home/Search Document Details and Download
Summary Related Articles |
This paper is cited in the following contexts:
Using Games for Benchmarking and Representing the.. - Fey, Kinder, Drechsler (Correct)
....263511 102.46 s 36 no 22417 75054 0.49 s 36 yes 29080 76437 7.04 s two functions, building a sub expression or during sifting, the number of nodes can temporarily surpass the number of nodes that are finally needed. 4. 1 n Queens The n Queens problem has been used as a benchmark in [11] and [12] already. Its suitability for this purpose is emphasized by the first experiment. In Table 1 the results are given. As can be seen calculating the solution of the problems with n less than seven is very fast. The threshold for automatic sifting is reached for n greater than five only. In this case ....
S. Minato and S. Ishihara. Streaming BDD manipulation for large-scale combinatorial problems. In Design, Automation and Test in Europe, pages 224--228, 2001.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC