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

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

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

in chapter 1, charactrizations of fragmentability, which are obtained by namioka (37), ribarska (45) and kenderov-moors (32), are given. also the connection between fragmentability and its variants and other topics in banach spaces such as analytic space, the radone-nikodym property, differentiability of convex functions, kadec renorming are discussed. in chapter 2, we use game characterization...

2013
R. Madhanmohan K. Parkavi S. Ni Y. Tseng Y. Chen

One of the fundamental operations in wireless ad hoc networks is broadcasting. To successfully reducing the number of transmissions of broadcast that are required to achieve full delivery with energy consumption using local broadcast algorithm. This broadcast algorithm is proposed for guarantee with full delivery and successful approximation to the optimum solution without considering the node ...

2008
A. J. Cuesta F. Prada

Virial mass is used as an estimator for the mass of a dark matter halo. However, the commonly used constant overdensity criterion does not reflect the dynamical structure of haloes. Here we analyze dark matter cosmological simulations in order to obtain properties of haloes of different masses focusing on the size of the region with zero mean radial velocity. Dark matter inside this region is s...

2006
Adam Antonik Nathaniel Charlton Michael Huth

We propose a pattern for designing algorithms that are in P by construction and under-approximate the winning regions of both players in parity games. This approximation is achieved by the interaction of finitely many aspects, each performing an efficient static analysis. We present several such aspects and illustrate their relative precision and interaction.

Journal: :Technique et Science Informatiques 2012
Olivier Bouissou

In the field of static analysis, abstract interpretation based techniques compute over approximations of the set of possible behaviors of programs. These over-approximations give properties on the program that can be used to prove the abscence of some bugs. In the case of control command programs, the behavior of the program depends on the physical environment with which it interacts. This envi...

2003
Ted Kremenek Dawson R. Engler

This paper explores z-ranking, a technique to rank error reports emitted by static program checking analysis tools. Such tools often use approximate analysis schemes, leading to false error reports. These reports can easily render the error checker useless by hiding real errors amidst the false, and by potentially causing the tool to be discarded as irrelevant. Empirically, all tools that effec...

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

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