يعرض 61 - 80 نتائج من 10,485 نتيجة بحث عن '(((( algorithm ai function ) OR ( algorithm system function ))) OR ( algorithm python function ))*', وقت الاستعلام: 0.45s تنقيح النتائج
  1. 61

    Feature subset search results. حسب Xutao Liu (13006965)

    منشور في 2023
    الموضوعات:
  2. 62

    Experimental environment. حسب Xutao Liu (13006965)

    منشور في 2023
    الموضوعات:
  3. 63

    The basic framework of dual flow networks. حسب Xutao Liu (13006965)

    منشور في 2023
    الموضوعات:
  4. 64

    Fig 4 - حسب Xutao Liu (13006965)

    منشور في 2023
    الموضوعات:
  5. 65

    S1 Data - حسب Xutao Liu (13006965)

    منشور في 2023
    الموضوعات:
  6. 66

    Image convolution calculation process. حسب Xutao Liu (13006965)

    منشور في 2023
    الموضوعات:
  7. 67
  8. 68

    Texture analysis results. حسب Tsutomu Gomi (7382183)

    منشور في 2019
    الموضوعات:
  9. 69
  10. 70
  11. 71
  12. 72
  13. 73
  14. 74

    Functional module diagram. حسب Fan Hongxia (21029673)

    منشور في 2025
    الموضوعات:
  15. 75

    datasheet1_Algorithmic Probability-Guided Machine Learning on Non-Differentiable Spaces.pdf حسب Santiago Hernández-Orozco (5070209)

    منشور في 2021
    "…In doing so we use examples which enable the two approaches to be compared (small, given the computational power required for estimations of algorithmic complexity). We find and report that 1) machine learning can successfully be performed on a non-smooth surface using algorithmic complexity; 2) that solutions can be found using an algorithmic-probability classifier, establishing a bridge between a fundamentally discrete theory of computability and a fundamentally continuous mathematical theory of optimization methods; 3) a formulation of an algorithmically directed search technique in non-smooth manifolds can be defined and conducted; 4) exploitation techniques and numerical methods for algorithmic search to navigate these discrete non-differentiable spaces can be performed; in application of the (a) identification of generative rules from data observations; (b) solutions to image classification problems more resilient against pixel attacks compared to neural networks; (c) identification of equation parameters from a small data-set in the presence of noise in continuous ODE system problem, (d) classification of Boolean NK networks by (1) network topology, (2) underlying Boolean function, and (3) number of incoming edges.…"
  16. 76

    datasheet2_Algorithmic Probability-Guided Machine Learning on Non-Differentiable Spaces.zip حسب Santiago Hernández-Orozco (5070209)

    منشور في 2021
    "…In doing so we use examples which enable the two approaches to be compared (small, given the computational power required for estimations of algorithmic complexity). We find and report that 1) machine learning can successfully be performed on a non-smooth surface using algorithmic complexity; 2) that solutions can be found using an algorithmic-probability classifier, establishing a bridge between a fundamentally discrete theory of computability and a fundamentally continuous mathematical theory of optimization methods; 3) a formulation of an algorithmically directed search technique in non-smooth manifolds can be defined and conducted; 4) exploitation techniques and numerical methods for algorithmic search to navigate these discrete non-differentiable spaces can be performed; in application of the (a) identification of generative rules from data observations; (b) solutions to image classification problems more resilient against pixel attacks compared to neural networks; (c) identification of equation parameters from a small data-set in the presence of noise in continuous ODE system problem, (d) classification of Boolean NK networks by (1) network topology, (2) underlying Boolean function, and (3) number of incoming edges.…"
  17. 77

    datasheet1_Algorithmic Probability-Guided Machine Learning on Non-Differentiable Spaces.pdf حسب Santiago Hernández-Orozco (5070209)

    منشور في 2021
    "…In doing so we use examples which enable the two approaches to be compared (small, given the computational power required for estimations of algorithmic complexity). We find and report that 1) machine learning can successfully be performed on a non-smooth surface using algorithmic complexity; 2) that solutions can be found using an algorithmic-probability classifier, establishing a bridge between a fundamentally discrete theory of computability and a fundamentally continuous mathematical theory of optimization methods; 3) a formulation of an algorithmically directed search technique in non-smooth manifolds can be defined and conducted; 4) exploitation techniques and numerical methods for algorithmic search to navigate these discrete non-differentiable spaces can be performed; in application of the (a) identification of generative rules from data observations; (b) solutions to image classification problems more resilient against pixel attacks compared to neural networks; (c) identification of equation parameters from a small data-set in the presence of noise in continuous ODE system problem, (d) classification of Boolean NK networks by (1) network topology, (2) underlying Boolean function, and (3) number of incoming edges.…"
  18. 78

    datasheet2_Algorithmic Probability-Guided Machine Learning on Non-Differentiable Spaces.zip حسب Santiago Hernández-Orozco (5070209)

    منشور في 2021
    "…In doing so we use examples which enable the two approaches to be compared (small, given the computational power required for estimations of algorithmic complexity). We find and report that 1) machine learning can successfully be performed on a non-smooth surface using algorithmic complexity; 2) that solutions can be found using an algorithmic-probability classifier, establishing a bridge between a fundamentally discrete theory of computability and a fundamentally continuous mathematical theory of optimization methods; 3) a formulation of an algorithmically directed search technique in non-smooth manifolds can be defined and conducted; 4) exploitation techniques and numerical methods for algorithmic search to navigate these discrete non-differentiable spaces can be performed; in application of the (a) identification of generative rules from data observations; (b) solutions to image classification problems more resilient against pixel attacks compared to neural networks; (c) identification of equation parameters from a small data-set in the presence of noise in continuous ODE system problem, (d) classification of Boolean NK networks by (1) network topology, (2) underlying Boolean function, and (3) number of incoming edges.…"
  19. 79
  20. 80