• Title/Summary/Keyword: 정복 알고리즘

Search Result 23, Processing Time 0.018 seconds

Challenges in Competition Law in Homodeus Era (호모데우스 시대에서 경쟁법의 도전)

  • Shon, Donghwan
    • The Journal of the Convergence on Culture Technology
    • /
    • v.7 no.3
    • /
    • pp.285-292
    • /
    • 2021
  • In Sapiens it shows the reason that sapiens has conquered the earth for the invention of intersubjective reality. In Homodeus sapiens made the science revolution through the religion of humanism. The development of science showed that human free will and emotion is just made through the chemical interaction of neuron which can be manipulated and developed. Algorithm and data wlll be the sovereign which make decision in everything. Yuval Harari tells us the Homodeus appear and break down the order of equality. His anticipation proves right in competition law issues. The collusion through the algorithm makes it difficult to apply existing cartel logic. Agreement is the ground of responsibility but undertaking is not responsible in the market where sovereign algorithm decides eveything. Extreme price differentiation can appear and break down the existing market logic and competition dogma. Everything changes and it is necessary to have the flexible attitude and develop new logic.

An Exact Division Algorithm for Change-Making Problem (거스름돈 만들기 문제의 정확한 나눗셈 알고리즘)

  • Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.22 no.3
    • /
    • pp.185-191
    • /
    • 2022
  • This paper proposed a division algorithm of performance complexity $O{\frac{n(n+1)}{2}}$ for a change-making problem(CMP) in which polynomial time algorithms are not known as NP-hard problem. CMP seeks to minimize the sum of the xj number of coins exchanged when a given amount of money C is exchanged for cj,j=1,2,⋯,n coins. Known polynomial algorithms for CMPs are greedy algorithms(GA), divide-and-conquer (DC), and dynamic programming(DP). The optimal solution can be obtained by DP of O(nC), and in general, when given C>2n, the performance complexity tends to increase exponentially, so it cannot be called a polynomial algorithm. This paper proposes a simple algorithm that calculates quotient by dividing upper triangular matrices and main diagonal for k×n matrices in which only j columns are placed in descending order of cj of n for cj ≤ C and i rows are placed k excluding all the dividers in cj. The application of the proposed algorithm to 39 benchmarking experimental data of various types showed that the optimal solution could be obtained quickly and accurately with only a calculator.

Phonetic Acoustic Knowledge and Divide And Conquer Based Segmentation Algorithm (음성학적 지식과 DAC 기반 분할 알고리즘)

  • Koo, Chan-Mo;Wang, Gi-Nam
    • The KIPS Transactions:PartB
    • /
    • v.9B no.2
    • /
    • pp.215-222
    • /
    • 2002
  • This paper presents a reliable fully automatic labeling system which fits well with languages having well-developed syllables such as in Korean. The ASL System utilize DAC (Divide and Conquer), a control mechanism, based segmentation algorithm to use phonetic and acoustic information with greater efficiency. The segmentation algorithm is to devide speech signals into speechlets which is localized speech signal pieces and to segment each speechlet for speech boundaries. While HMM method has uniform and definite efficiencies, the suggested method gives framework to steadily develope and improve specified acoustic knowledges as a component. Without using statistical method such as HMM, this new method use only phonetic-acoustic information. Therefore, this method has high speed performance, is consistent extending the specific acoustic knowledge component, and can be applied in efficient way. we show experiment result to verify suggested method at the end.