نتایج جستجو برای: golden ratio algorithm

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

Journal: :The Journal of the Kansas Medical Society 1969
L Speer

and saw that their graphs were parabolas. Since this shape was so different from a circle, with what did not appear to me to be an enormous difference in mathematical form, I wondered what other curves of the form x + y = 1 would look like. Fortunately, I have an Atari 800 computer at home which allows me the opportunity to make such an investigation relatively simple. Eventually, I became bore...

2011
K. Glover H. Hulley

The golden ratio has fascinated people of diverse interests for at least 2,400 years (see e.g. [24]). In mathematics (and the arts) two quantities a and b are in the golden ratio if the ratio of the sum of the quantities a+b to the larger quantity a is equal to the ratio of the larger quantity a to the smaller quantity b . This amounts to setting (a+b)/a = a/b =: φ and solving φ2−φ−1 = 0 which ...

2013
Maan Ibrahim Al-Marzok Kais Raad Abdul Majeed Ibrahim Khalil Ibrahim

BACKGROUND The maxillary anterior teeth are important in achieving pleasing dental aesthetics. Various methods are used to measure the size and form of them, including the golden proportion between their perceived widths, and the width-to-height ratio, referred to as the golden standard. The purpose of this study was conducted to evaluate whether consistent relationships exist between tooth wid...

Journal: :Journal of Craniofacial Surgery 2019

Journal: :The European Physical Journal C 2017

Journal: :Italian journal of anatomy and embryology 2022

Objectives: Divine golden ratio (Phi = 1.618) observed in several human body parts such as, heart, dentition and upper limb tends to present homeostasis anatomy physiology. This cross sectional survey study investigates the relationship of with BMI, GPA, gender blood serotypes Jordan.
 Methods: Demographic features including weight, lengths some ABO/Rh groups were measured for 380 undergra...

2016
Evgeny Dantsin Michael Gavrilovich Edward A. Hirsch Boris Konev

We describe approximation algorithms for (unweighted) MAX SAT with performance ratios arbitrarily close to 1 (in particular, when performance ratios exceed the limit of polynomialtime approximation). Namely, we show how to construct an (α + ε)-approximation algorithm A from a given polynomial-time α-approximation algorithm A0. The algorithm A runs in time of the order φ −1 K , where φ is the go...

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

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