Sciweavers

62 search results - page 2 / 13
» A New Approach to Exact Crossing Minimization
Sort
View
ISCAS
2003
IEEE
122views Hardware» more  ISCAS 2003»
14 years 1 months ago
Reducing the number of variable movements in exact BDD minimization
Ordered Binary Decision Diagrams (BDDs) are frequently used in logic synthesis. In this paper a new exact BDD minimization algorithm is presented, which is based on state space se...
Rüdiger Ebendt
JEA
2010
94views more  JEA 2010»
13 years 2 months ago
Layer-free upward crossing minimization
An upward drawing of a DAG G is a drawing of G in which all edges are drawn as curves increasing monotonically in the vertical direction. In this paper, we present a new approach f...
Markus Chimani, Carsten Gutwenger, Petra Mutzel, H...
CPAIOR
2004
Springer
14 years 1 months ago
A New Exact Solution Algorithm for the Job Shop Problem with Sequence-Dependent Setup Times
Abstract. We propose a new solution approach for the Job Shop Problem with Sequence Dependent Setup Times (SDST-JSP). The problem consists in scheduling jobs, each job being a set ...
Christian Artigues, Sana Belmokhtar, Dominique Fei...
ASYNC
2001
IEEE
136views Hardware» more  ASYNC 2001»
13 years 11 months ago
Efficient Exact Two-Level Hazard-Free Logic Minimization
This paper presents a new approach to two-level hazardfree sum-of-products logic minimization. No currently available minimizers for single-output literal-exact two-level hazard-f...
Chris J. Myers, Hans M. Jacobson
COMPGEOM
2005
ACM
13 years 9 months ago
Abstract order type extension and new results on the rectilinear crossing number
Order Type Extension and New Results ectilinear Crossing Number - Extended Abstract Oswin Aichholzer∗ Hannes Krasser† We provide a complete data base of all realizable order t...
Oswin Aichholzer, Hannes Krasser