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

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

Journal: :CoRR 2016
Guo Zhao

The concept of Shannon entropy of random variables was generalized to measurable functions in general, and to simple functions with finite values in particular. It is shown that the information measure of a function is related to the time complexity of search problems concerning the function in question. Formally, given a Turing reduction from a search problem y x f  ) ( to another search prob...

2004
E. S. Hori S. Skogestad W. H. Kwong

The concept of complexity has been widely studied in the last years in several different areas. Although many writers on the subject understand qualitatively similar things by the term ”complexity”, a transition from this qualitative understanding to a quantitative approach would be highly desirable and necessary. The lack of understanding in this area has hindered planners in deciding how much...

2017
Shaull Almagor Denis Kuperberg Orna Kupferman

2010

In recounting the e6pietls-reas-ens---ereK-£-HSC-S f-Gfour tr-a-ditional problems in developing and maintaining computer software, many authorities have mentioned complexity (e.g., References 2, 8, 15). The complexity pointed to sometimes is the inherent complexity of the jobs the computer is to do; sometimes it is the complexity of the systems or programs that direct the computer to do the job...

Journal: :CoRR 2002
Ricardo López-Ruiz Héctor Mancini Xavier Calbet

In this chapter, a statistical measure of complexity is introduced and some of its properties are discussed. Also, some straightforward applications are shown.

Journal: :iranian journal of public health 0
armin allahverdy amir homayoun jafari

background: noise pollution is one of the most harmful ambiance disturbances. it may cause many deficits in ability and activity of persons in the urban and industrial areas. it also may cause many kinds of psychopathies. therefore, it is very important to measure the risk of this pollution in different area. methods: this study was conducted in the department of medical physics and biomedical ...

1999
Sergey V. Matveyev

In this work we give an approach to analyse a surface topology complexity inside a cube in the Marching Cube (MC) algorithm. The number of the isosurface intersections with the cube diagonals is used as the complexity criterion. In the case of the trilinear interpolation we have the cubic equation on the each cube diagonal and there is a possibility to find the coordinates of the three intersec...

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

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