We aim at comparing Constraint Programming (CP) and SatisfiabilityModulo Theories (SMT) techniques in order to solve problems of Very Large ScaleIntegration (VLSI). We have built two models: one using ...
Abstract: Dynamic Programming (DP)-based stereo matching consists of three major parts: matching cost computation (M.C.C.), minimum cost accumulation (M.C.A.), and disparity optimization (D.O.). This ...
Abstract: Global routing is an essential part of VLSI physical design, and has been traditionally solved using sequential or concurrent methods. In the sequential techniques, routes are generated one ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback