نتایج جستجو برای: very large

تعداد نتایج: 1567007  

2007
CANTURK ISCI IZZET KALE RICHARD C.S. MORLING Alan Wood

i

متن کامل
2006
Arun Kumar Choudhury Achintya Halder Soumendu Bhattacharya Ganesh P. Srinivasan Sayantan Das Ansuman Banerjee Prasenjit Basu Pallab Dasgupta Anantha Chandrakasan Susmita Sur-Kolay

متن کامل
2004
Paul P. Sotiriadis Vahid Tarokh Anantha Chandrakasan

متن کامل
Journal: :IEEE Design & Test of Computers 1998
Kenneth L. Shepard Vinod Narayanan

متن کامل
Journal: :Integration 2010
Manel Puig-Vidal José María López-Villegas Atila Herms

متن کامل
2013
JUNG-TAI TSAI Weiping Shi Rabi N. Mahapatra Chanan Singh

متن کامل
2013
Xue-Xin Liu

OF THE DISSERTATION Parallel and Statistical Analysis and Modeling of Nanometer VLSI Systems

متن کامل
2005
Ulrich Brenner

متن کامل
2017
B. Szelag F. Balestra G. Ghibaudo M. Dutoit

متن کامل
Journal: :Inf. Process. Lett. 1998
Chi-Hsiang Yeh Behrooz Parhami

In this paper, we present efficient layouts for complete graphs and star graphs. We show that an N-node complete graph can be optimally laid out using LN2/4] tracks for a colinear layout, and can be laid out in N4/16 + o(N4) area for a 2D layout. We also show that an N-node star graph can be laid out in N2/16 + o(N2) area, which is smaller than any possible layout of a similar-size hypercube. T...

متن کامل

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید