نتایج جستجو برای: average delay

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

Journal: :IEICE Transactions 2011
Tadashi Yasufuku Yasumi Nakamura Piao Zhe Makoto Takamiya Takayasu Sakurai

Dependence of within-die delay variations on power supply voltage (VDD) is measured down to 0.4 V. The VDD dependence of the within-die delay variation of manual layout and irregular auto place and route (P&R) layout are compared for the first time. The measured relative delay (=sigma/average) variation difference between the manual layout and the P&R layout decreases from 1.56% to 0.07% with r...

2009
Xi-Ming Sun Jun Zhao

This paper deals with the problem of exponential stability of linear switched delay systems. An average dwell time method is introduced into linear switched delay systems for the first time and LMIs’ conditions are presented to guarantee robust exponential stability of such systems. A lower bound of average dwell time is given. Exponential decay estimates for the states of such systems are also...

2007
Hong Luo Yu Wang Ku He Rong Luo Huazhong Yang Yuan Xie

In this paper, we propose a gate-level NBTI delay degradation model, where the stress voltage variability due to PMOS transistors’ stacking effect is considered for the first time. Experimental results show that our gate-level NBTI delay degradation model results in a tighten upper bound for circuit performance analysis. The traditional circuit degradation analysis leads to on average 59.3% ove...

Journal: :international journal of electrical and electronics engineering 0
a. naderii h. ghasemzadehii a. pourazar m. aliasgharyii

in this paper, a new structure possessing the advantages of low-power consumption, less hardware and high-speed is proposed for fuzzy controller. the maximum output delay for general fuzzy logic controllers (flc) is about 86 ns corresponding to 11.63 mflips (fuzzy logic inference per second) while this amount of the delay in the designed fuzzy controller becomes 52ns that corresponds to 19.23 m...

1995
K. D. Boese J. Cong A. B. Kahng K. S. Leung B. A. McCoy G. Robins M. Sarrafzadeh C. K. Wong S. K. Rao P. Sadayappan F. K. Hwang

Analysis of Elmore delay in RC trees suggests that low-delay routing trees should trade oo cost and radius according to net size and interconnect technology. Previous approaches 2, 3, 8, 13] begin with a depth-rst traversal of T M and insert shortest paths as needed to maintain a prescribed radius bound. In contrast, our ALG1 (and ALG2) directly combine the recurrences for Prim's MST algorithm ...

Journal: :archives of breast cancer 0
iraj harirchi department of surgery, tehran university of medical sciences, tehran, iran mojgan karbakhsh department of community and preventive medicine, tehran university of medical sciences, tehran, iran fatemeh hadi school of medicine, tehran university of medical sciences, tehran, iran seyyedeh sedigheh madani school of medicine, tehran university of medical sciences, tehran, iran fereydoun sirati department of surgery, tehran university of medical sciences, tehran, iran shadi kolahdoozan digestive diseases research center, shariati hospital, tehran university of medical sciences, tehran, iran

background: the purpose of this study was to compare patient delay, diagnosis delay and treatment delay in breast cancer patients of selected public and private health centers in tehran, iran. methods: in this cross-sectional study, female patients with newly diagnosed breast cancer in a public medical complex and a private breast clinic within one year were included. patient delay was consider...

2012
Jae-Hyun Kim

© 2012 ETRI Journal, Volume 34, Number 3, June 2012 This letter proposes a new distributed scheduling scheme combined with routing to support the quality of service of realtime applications in wireless mesh networks. Next, this letter drives average end-to-end delay of the proposed scheduling scheme that sequentially schedules the slots on a path. Finally, this letter simulates the time divisio...

Journal: :Wireless Networks 2004
Bhaskar Krishnamachari Rung-Hung Gau Stephen B. Wicker Zygmunt J. Haas

In a high-capacity cellular network with limited spectral resources, it is desirable to minimize the radio bandwidth costs associated with paging when locating mobile users. Sequential paging, in which cells in the coverage area are partitioned into groups and paged in a non-increasing order of user location probabilities, permits a reduction in the average radio costs of paging at the expense ...

2011
Kunqi Guo Lixin Sun Xiaoqun Zhao Shilou Jia

In this paper, we formulate the optimal channel access of secondary user system in cognitive radio networks as the total reward maximization by Partially Observable Markov Decision Processes (POMDPs). Match Ability is proposed that takes allowable channel transmission rate and bit-error-rate (BER) required by receiving end into account. A heuristic greedy algorithm for channel access is propose...

Journal: :Journal Comp. Netw. and Communic. 2008
Ralph El Khoury Rachid El Azouzi

We consider a wireless ad hoc network with random access channel. We present a model that takes into account topology, routing, random access in MAC layer, and forwarding probability. In this paper, we focus on drawing benefit from the interaction of the MAC (governed by IEEE 802.11 or slotted Aloha) and routing by defining a new cross-layer scheme for routing based on the limit number of retra...

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

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