نتایج جستجو برای: static complexity

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

Journal: :IEEE Trans. on CAD of Integrated Circuits and Systems 2003
Soha Hassoun Christopher Cromer Eduardo H. Calvillo Gámez

) Abstract— Static timing analysis is instrumental in efficiently verifying a design’s temporal behavior to ensure correct functionality at the required frequency. This paper addresses static timing analysis in the presence of cross talk for circuits containing levelsensitive latches, typical in high-performance designs. The paper focuses on two problems. First, coupling in a sequential circuit...

Journal: :Complex Systems 2014
Roger J. Anderson Robert H. Sturges

Relationships among the performance, robustness, and design of naval weapons elevators can be found in both static and dynamic measures of complexity. This paper examines two such dynamic measures: compressed state complexity and the number of unique states used by the system. Simulation results show that the mean compressed state complexity does not have a trend, due to the effect of logical e...

2004
Gene Cheung Wai-tian Tan

Recent video coding standards such as H.264 offer the flexibility to select reference frames during motion estimation for predicted frames. The application of traditional Lagrangian approach to the reference frame selection problem suffers from either bounded worst-case error but high complexity, or low complexity but undetermined worst-case error. In this paper, we propose a dynamic programmin...

2009
Jongeun Lee Aviral Shrivastava

With continuous technology scaling, soft errors are becoming an increasingly important design concern even for earthbound applications. While compiler approaches have the potential to mitigate the effect of soft errors with minimal runtime overheads, static vulnerability estimation—an essential part of compiler approaches—is lacking due to its inherent complexity. This paper presents a static a...

2004
Luis Alejandro Cortés Petru Eles Zebo Peng

We address in this paper the combination of static and dynamic scheduling into an approach called quasi-static scheduling, in the context of real-time systems composed of hard and soft tasks. For the particular problem discussed in this paper, a single static schedule is too pessimistic while a purely dynamic scheduling approach causes a very high on-line overhead. In the proposed quasi-static ...

Journal: :Complexity 2011
Mohammed Shahadat Uddin Liaquat Hossain Shahriar Tanvir Hasan Murshed John W. Crawford

The significance of temporal changes in the topology of organizational communication networks during a crisis is studied using static and dynamic social network analysis (SNA). In static SNA, the network of interactions made during an entire data collection period is studied. For dynamic SNA, shorter segments of network data are used in the analysis. Using measures of degree centrality and core...

2008
Charles Hymans Olivier Levillain

Static analysis is a difficult task, partly because programming languages are extremely rich, and have intricate semantics with architecture-dependent aspects. We have therefore chosen to design Newspeak, a kernel language dedicated to the purpose of static analysis. And, we have implemented a front-end, C2Newspeak, that translates C programs into Newspeak. Thus, any static analysis algorithm t...

Journal: :JCP 2010
Md. Rafiqul Islam S. A. Ahsan Rajon

Short Text Compression is a great concern for data engineering and management. The rapid use of small devices especially, mobile phones and wireless sensors have turned short text compression into a demand-of-thetime. In this paper, we propose an approach of compressing short English text for smart devices. The prime objective of this proposed technique is to establish a low-complexity lossless...

2012
Julien Henry David Monniaux Matthieu Moy

Abstract interpretation techniques can be made more precise by distinguishing paths inside loops, at the expense of possibly exponential complexity. SMT-solving techniques and sparse representations of paths and sets of paths avoid this pitfall. We improve previously proposed techniques for guided static analysis and the generation of disjunctive invariants by combining them with techniques for...

2016
Wei-Tsun Sun Claire Maiza Pascal Raymond Erwan Jahier

Obtaining Worst Case Execution Time (WCET) is essential for systems with timing requirement. This is because the violation of such requirement may lead to catastrophic results in safety critical systems. WCET can be acquired through static or dynamic analyses. With static analysis, it is less obvious to observe the timing behaviors of the analyzed system during its actual execution. While dynam...

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

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