Showing 41 - 60 results of 1,035 for search '"Analysis of algorithms"', query time: 0.99s Refine Results
  1. 41
  2. 42
  3. 43
  4. 44
  5. 45
  6. 46
  7. 47

    COUNTERFACTUAL ANALYSIS BY ALGORITHMIC COMPLEXITY: A METRIC BETWEEN POSSIBLE WORLDS by NICHOLAS CORRÊA, NYTHAMAR FERNANDES DE OLIVEIRA

    Published 2022-08-01
    “…In this study, we propose a new form of analysis for counterfactuals: analysis by algorithmic complexity. Inspired by Lewis-Stalnaker's Possible Worlds Semantics, the proposed method allows for a new interpretation of the debate between David Lewis and Robert Stalnaker regarding the Limit and Singularity assumptions. …”
    Get full text
    Article
  8. 48
  9. 49
  10. 50
  11. 51
  12. 52
  13. 53
  14. 54

    The Construction of an Universal Linearized Control Flow Graph for Static Code Analysis of Algorithms by V. A. Bitner, N. V. Zaborovsky

    Published 2013-04-01
    “…The practical usefulness of the graph considered is the existence of the fast and optimal search of the unique execution paths that is valuable in the methods of static code analysis of algorithms for race condition search. Optimizing compiler CLANG&LLVM is used as a technical tool for building a linearized control flow graph. …”
    Get full text
    Article
  15. 55

    The Construction of an Universal Linearized Control Flow Graph for Static Code Analysis of Algorithms by V. A. Bitner, N. V. Zaborovsky

    Published 2013-01-01
    “…The practical usefulness of the graph considered is the existence of the fast and optimal search of the unique execution paths that is valuable in the methods of static code analysis of algorithms for race condition search. Optimizing compiler CLANG&LLVM is used as a technical tool for building a linearized control flow graph. …”
    Get full text
    Article
  16. 56
  17. 57
  18. 58

    Reprojection Error Analysis and Algorithm Optimization of Hand–Eye Calibration for Manipulator System by Gang Peng, Zhenyu Ren, Qiang Gao, Zhun Fan

    Published 2023-12-01
    “…In this study, a new method for error analysis and algorithm optimization is presented. An error analysis of the method is carried out using a priori knowledge that the location of the augmented reality markers is fixed during the calibration process. …”
    Get full text
    Article
  19. 59
  20. 60

    Tight Bounds for Minimax Grid Matching, with Applications to the Average Case Analysis of Algorithms by Leighton, Tom, Shor, Peter

    Published 2023
    “…The minimax grid matching problem is a fundamental combinatorial problem associated with the average case analysis of algorithms. The problem has arisen in a number of interesting and seemingly unrelated areas, including wafer-scale integration of systolic arrays, two-dimentsional discrepancy problems, and testing pseudorandom number generators. …”
    Get full text