نتایج جستجو برای: probabilistic pseudo static analysis
تعداد نتایج: 2989567 فیلتر نتایج به سال:
Efficient structural reanalysis for high-rank modification plays an important role in engineering computations which require repeated evaluations of responses, such as optimization and probabilistic analysis. To improve the efficiency computations, a novel approximate static method based on system reduction iterative solution is proposed statically indeterminate structures with modification. In...
Schedulability analysis for hard real-time systems requires bounds on the execution times of its tasks. To obtain useful bounds in the presence of caches, cache analysis is mandatory. The subject-matter of this article is the static analysis of the tree-based PLRU cache replacement policy (pseudo least-recently used), for which the precision of analyses lags behind those of other policies. We i...
Schedulability analysis for hard real-time systems requires bounds on the execution times of its tasks. To obtain useful bounds in the presence of caches, cache analysis is mandatory. The subject-matter of this article is the static analysis of the tree-based PLRU cache replacement policy (pseudo least-recently used), for which the precision of analyses lags behind those of other policies. We i...
explosion and fire on an offshore rig can lead to its minor or complete damage and sinking which means the loss of life or environmental pollution. hence the use of techniques such as blast wall is crucial to reduce the detrimental effects. these blast walls are designed for explosion wave of length between 0.1 to 1 of load mainly to protect the personnel and critical sections. in this research...
explosion and fire on an offshore rig can lead to its minor or complete damage and sinking which means the loss of life or environmental pollution. hence the use of techniques such as blast wall is crucial to reduce the detrimental effects. these blast walls are designed for explosion wave of length between 0.1 to 1 of load mainly to protect the personnel and critical sections. in this research...
The present study deals with word frequencies distributions and their relation to probabilistic Information Retrieval (IR) models. We examine the burstiness phenomenon (a rich get richer phenomenon) of word frequencies in textual collections. We propose to model this phenomenon as a property of probability distributions and we show that the Beta Negative Binomial distribution is a good statisti...
Automated programming assessment is a computer aided approach in checking and grading students programming exercises, without the hassle of doing it manually. This is an attempt to conduct programming exercise assessment using one of the static analysis approaches; a non-structural similarity analysis by using the pseudo-code comparison. The application will generate the pseudo-code for the stu...
Probabilistic points-to analysis is an analysis technique for defining the probabilities on the points-to relations in programs. It provides the compiler with some optimization chances such as speculative dead store elimination, speculative redundancy elimination, and speculative code scheduling. Although several static probabilistic points-to analysis techniques have been developed for C langu...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید