Search alternatives:
bayesian optimization » based optimization (Expand Search)
points optimization » joint optimization (Expand Search), process optimization (Expand Search), potency optimization (Expand Search)
sample points » sampling points (Expand Search)
b bayesian » _ bayesian (Expand Search), a bayesian (Expand Search), 95 bayesian (Expand Search)
binary b » binary _ (Expand Search)
Showing 1 - 20 results of 33 for search '(( binary b bayesian optimization algorithm ) OR ( entire sample points optimization algorithm ))*', query time: 0.33s Refine Results
  1. 1
    Application of ABC SMC to the fitting of the binary flip with cusp model.

    Application of ABC SMC to the fitting of the binary flip with cusp model. by Elena Camacho-Aguilar (10906327)

    Published 2021
    Save to List
    Saved in:
  2. 2
    Fitness score statistics for BADASS optimization of alpha-amylase (AMY_BACSU).

    Fitness score statistics for BADASS optimization of alpha-amylase (AMY_BACSU). by Carlos A. Gomez-Uribe (21492788)

    Published 2025
    Save to List
    Saved in:
  3. 3
    Effective region sampling strategy.

    Effective region sampling strategy. by Yu Gu (162342)

    Published 2025
    “…<div><p>Aiming at the problems of blind sampling points and slow planning speed of path planning Rapidly-exploring Random Trees algorithm, an effective region sampling Levy Rapidly-exploring Random Trees algorithm (LRRT*) is proposed based on the improved Levy flight strategy. …”
    Save to List
    Saved in:
  4. 4
    Probability graphical model of scMSI.

    Probability graphical model of scMSI. by Yuqian Liu (1413763)

    Published 2024
    Save to List
    Saved in:
  5. 5
    Flow diagram of the reachable workspace.

    Flow diagram of the reachable workspace. by Zesheng Wang (15244172)

    Published 2025
    “…A sensitivity analysis is performed using the finite difference method to screen for and eliminate error sources with a negligible impact on the moving platform’s pose. Measurement points are then selected uniformly throughout the workspace using the farthest point sampling algorithm. …”
    Save to List
    Saved in:
  6. 6
    Size parameters of the 5PUS-RPUR parallel robot.

    Size parameters of the 5PUS-RPUR parallel robot. by Zesheng Wang (15244172)

    Published 2025
    “…A sensitivity analysis is performed using the finite difference method to screen for and eliminate error sources with a negligible impact on the moving platform’s pose. Measurement points are then selected uniformly throughout the workspace using the farthest point sampling algorithm. …”
    Save to List
    Saved in:
  7. 7
    Structure diagram of branched PUS with errors.

    Structure diagram of branched PUS with errors. by Zesheng Wang (15244172)

    Published 2025
    “…A sensitivity analysis is performed using the finite difference method to screen for and eliminate error sources with a negligible impact on the moving platform’s pose. Measurement points are then selected uniformly throughout the workspace using the farthest point sampling algorithm. …”
    Save to List
    Saved in:
  8. 8
    PK subproblem 3.

    PK subproblem 3. by Zesheng Wang (15244172)

    Published 2025
    “…A sensitivity analysis is performed using the finite difference method to screen for and eliminate error sources with a negligible impact on the moving platform’s pose. Measurement points are then selected uniformly throughout the workspace using the farthest point sampling algorithm. …”
    Save to List
    Saved in:
  9. 9
    The two recognized basic PK sub-problems.

    The two recognized basic PK sub-problems. by Zesheng Wang (15244172)

    Published 2025
    “…A sensitivity analysis is performed using the finite difference method to screen for and eliminate error sources with a negligible impact on the moving platform’s pose. Measurement points are then selected uniformly throughout the workspace using the farthest point sampling algorithm. …”
    Save to List
    Saved in:
  10. 10
    Structure diagram of branched RPUR with errors.

    Structure diagram of branched RPUR with errors. by Zesheng Wang (15244172)

    Published 2025
    “…A sensitivity analysis is performed using the finite difference method to screen for and eliminate error sources with a negligible impact on the moving platform’s pose. Measurement points are then selected uniformly throughout the workspace using the farthest point sampling algorithm. …”
    Save to List
    Saved in:
  11. 11
    5PUS-RPUR parallel robot system.

    5PUS-RPUR parallel robot system. by Zesheng Wang (15244172)

    Published 2025
    “…A sensitivity analysis is performed using the finite difference method to screen for and eliminate error sources with a negligible impact on the moving platform’s pose. Measurement points are then selected uniformly throughout the workspace using the farthest point sampling algorithm. …”
    Save to List
    Saved in:
  12. 12
    Overview of our approach.

    Overview of our approach. by Carlos A. Gomez-Uribe (21492788)

    Published 2025
    Save to List
    Saved in:
  13. 13
    UR5 robotic arm.

    UR5 robotic arm. by Yu Gu (162342)

    Published 2025
    “…<div><p>Aiming at the problems of blind sampling points and slow planning speed of path planning Rapidly-exploring Random Trees algorithm, an effective region sampling Levy Rapidly-exploring Random Trees algorithm (LRRT*) is proposed based on the improved Levy flight strategy. …”
    Save to List
    Saved in:
  14. 14
    Reselect parent node.

    Reselect parent node. by Yu Gu (162342)

    Published 2025
    “…<div><p>Aiming at the problems of blind sampling points and slow planning speed of path planning Rapidly-exploring Random Trees algorithm, an effective region sampling Levy Rapidly-exploring Random Trees algorithm (LRRT*) is proposed based on the improved Levy flight strategy. …”
    Save to List
    Saved in:
  15. 15
    Ablation experiment.

    Ablation experiment. by Yu Gu (162342)

    Published 2025
    “…<div><p>Aiming at the problems of blind sampling points and slow planning speed of path planning Rapidly-exploring Random Trees algorithm, an effective region sampling Levy Rapidly-exploring Random Trees algorithm (LRRT*) is proposed based on the improved Levy flight strategy. …”
    Save to List
    Saved in:
  16. 16
    Simulation data of complex obstacle environment.

    Simulation data of complex obstacle environment. by Yu Gu (162342)

    Published 2025
    “…<div><p>Aiming at the problems of blind sampling points and slow planning speed of path planning Rapidly-exploring Random Trees algorithm, an effective region sampling Levy Rapidly-exploring Random Trees algorithm (LRRT*) is proposed based on the improved Levy flight strategy. …”
    Save to List
    Saved in:
  17. 17
    Greedy back path.

    Greedy back path. by Yu Gu (162342)

    Published 2025
    “…<div><p>Aiming at the problems of blind sampling points and slow planning speed of path planning Rapidly-exploring Random Trees algorithm, an effective region sampling Levy Rapidly-exploring Random Trees algorithm (LRRT*) is proposed based on the improved Levy flight strategy. …”
    Save to List
    Saved in:
  18. 18
    Rewire.

    Rewire. by Yu Gu (162342)

    Published 2025
    “…<div><p>Aiming at the problems of blind sampling points and slow planning speed of path planning Rapidly-exploring Random Trees algorithm, an effective region sampling Levy Rapidly-exploring Random Trees algorithm (LRRT*) is proposed based on the improved Levy flight strategy. …”
    Save to List
    Saved in:
  19. 19
    Planning effect:

    Planning effect: by Yu Gu (162342)

    Published 2025
    “…<div><p>Aiming at the problems of blind sampling points and slow planning speed of path planning Rapidly-exploring Random Trees algorithm, an effective region sampling Levy Rapidly-exploring Random Trees algorithm (LRRT*) is proposed based on the improved Levy flight strategy. …”
    Save to List
    Saved in:
  20. 20
    Planning effect:

    Planning effect: by Yu Gu (162342)

    Published 2025
    “…<div><p>Aiming at the problems of blind sampling points and slow planning speed of path planning Rapidly-exploring Random Trees algorithm, an effective region sampling Levy Rapidly-exploring Random Trees algorithm (LRRT*) is proposed based on the improved Levy flight strategy. …”
    Save to List
    Saved in:

Search Tools: