Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

69

Voted

ASPDAC
2004
ACM

84views Hardware» more ASPDAC 2004»

Combining ordered best-first search with branch and bound for exact BDD minimization

15 years 9 months ago

Combining ordered best-first search with branch and bound for exact BDD minimization

Download www.informatik.uni-bremen.de

Rüdiger Ebendt, Wolfgang Günther, Rolf D

Real-time Traffic

ASPDAC 2004 |

claim paper

Related Content

» QuasiExact BDD Minimization Using Relaxed BestFirst Search

» A Framework for Quasiexact Optimization Using Relaxed BestFirst Search

» Minimizing the Maximum Number of Open Stacks by Customer Search

» SATBased Image Computation with Application in Reachability Analysis

Post Info
More Details (n/a)

Added	30 Jun 2010
Updated	30 Jun 2010
Type	Conference
Year	2004
Where	ASPDAC
Authors	Rüdiger Ebendt, Wolfgang Günther, Rolf Drechsler

Comments (0)