金融财经行业专业英语第166页 ... EUFTG 最终用户设施任务组 Euler path 欧拉（通）路 European Academic and Research Network EARNn欧洲学术网 ...
基于20个网页-相关网页
While Euler Path is a solution to the floor plan of Compementy CMOS circuit layout, it is incapable to non-complementry CMOS circurt or CMOS circuit with none Euler path.
欧拉路径法是解决互补CMOS电路版图布局的一种方法,然而对于不存在欧拉路径的互补CMOS电路和非互补CMOS电路则无能为力。
参考来源 - X处理器中高性能存储部件全定制设计与实现·2,447,543篇论文数据，部分数据来源于NoteExpress
In this dissertation, we present an expanded Euler Path method, which extend the origin Euler Path method to the floor plan of all kind of CMOS circuit as well as the dynamic circuit.
本文在基本欧拉路径方法的基础上，提出一种拓展的欧拉路径方法，使之能够应用于所有互补CMOS电路和动态电路的版图布局。
Konigsberg had seven Bridges, and in 1736 Euler proved it was impossible to find a path that allowed you to cross each bridge exactly once.
哥尼斯堡曾有七座桥梁，1736年，欧拉证明了要走过哥尼斯堡的七座桥且每桥只通过一次是不可能的。
For inspecting topological and geometrical unanimity of a solid model, principle of closed path topology and Euler′s formula are important tools.
闭路拓扑原理和欧拉公式是检验实体模型边界表示的拓扑与几何一致性的重要工具。
应用推荐