نتایج جستجو برای: most critical path

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

2001
Jayabrata Ghosh-Dastidar Nur A. Touba

Given an FPGA that has failed to meet its timing specification, techniques are proposed to efficiently diagnose the cause of the faulty behavior. An initial list of suspect configuration logic blocks (CLBs) and interconnects is generated using six-valued fault-free simulation and critical path tracing. The initial list of suspects is then reduced by exploiting the reconfigurability of an FPGA. ...

1998
E. Saez J. Villalba J. Hormigo F. J. Quiles J. I. Benavides E. L. Zapata

In this paper we present the FPGA implementation of a new word{serial CORDIC processor working with variable precision. It has been designed in such a way that it allows us to take advantage of the successive shifts in the coordinates involved in the CORDIC algorithm. This signiicatively reduces the total number of cycles required. Special attention has been paid to the design of the critical p...

2004
Jérémie Detrey Florent de Dinechin

This paper presents a new scheme for the hardware evaluation of elementary functions, based on a piecewise second order minimax approximation. The novelty is that this evaluation requires only one small rectangular multiplication. Therefore the resulting architecture combines a small table size, thanks to second-order evaluation, with a short critical path: Consisting of one table lookup, the r...

2010
N. Ravi Shankar K. Surya Narayana Rao V. Sireesha Ravi Shankar

The traditional PERT (Program Evaluation and Review Technique) model uses beta distribution as the distribution of activity duration and estimates the mean and the variance of activity duration using “pessimistic”, “most likely” and “optimistic” time estimates proposed by an expert. In the past several authors have modified the original PERT estimators to improve the accuracy. In this paper, on...

Journal: :Journal of Combinatorial Theory, Series B 2023

Every minor-closed class of matroids bounded branch-width can be characterized by a list excluded minors, but unlike graphs, this may need to infinite in general. However, for each fixed finite field F, the needs contain only finitely many F-representable matroids, due well-quasi-ordering under taking matroid minors [J.F. Geelen, A.M.H. Gerards, and G. Whittle (2002)]. But proof is non-construc...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه پیام نور - دانشگاه پیام نور استان تهران - دانشکده ادبیات و زبانهای خارجی 1393

the purpose of this study was to find the relationship between critical thinking and self-regulation with reading comprehension of iranian female elementary language learners. the present study is a correlational one having a descriptive design. two questionnaires, critical thinking questionnaire and self-regulation questionnaire which were valid and reliable questionnaires and four reading com...

Journal: :ecopersia 2011
seyed hedayat parvari ahmad pahlavanravi ali reza moghaddam nia abdolhamid dehvari davood parvari

several models have been developed to estimate land degradation rate and evaluate desertification severity. this study attempts to apply the medalus (mediterranean desertification and land use) model by considering existing conditions in the hamoun wetland, located in south-eastern iran. at first identification of the main factors affecting the desertification phenomenon was attempted, based on...

Journal: :CoRR 2017
Aravind Vasudevan David Gregg

The critical path of a group of tasks is an important measure that is commonly used to guide task allocation and scheduling on parallel computers. The critical path is the longest chain of dependencies in an acyclic task dependence graph. A problem arises on heterogeneous parallel machines where computation and communication costs can vary between different types of processor. Existing solution...

2015
Soon-Ho Kim Chi-Su Kim

SMT(Surface Mount Technology) machines are used to place electronic components onto a PCB(Printed Circuit Board). This study proposes a method of identifying the fastest path for picked up components to pass by a camera without stopping before being placed onto PCBs. The proposed method enables the gantry, responsible for moving the heads, to pass by the camera in the least amount of time possi...

Journal: :SIAM J. Discrete Math. 2013
Guoli Ding Stan Dziobiak

It is known that the list of excluded minors for the minor-closed class of graphs of path-width 6 3 numbers in the millions. However, if we restrict the class to 3-connected graphs of path-width 6 3, then we can characterize it by five excluded minors.

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

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