Soft robots solving hard problems

被引：0
|
作者：
Brennan, Marshall R.
机构：
来源：
DEVICE | 2024年 / 2卷 / 09期
关键词：
D O I：
10.1016/j.device.2024.100565
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
引用
收藏
页数：1
相关论文
共 50 条
  • [41] Solving hard-exploration problems with counting and replay approach
    Huang, Bo-Ying
    Tsai, Shi-Chun
    ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2022, 110
  • [42] Solving NP-hard combinatorial problems in the practical sense
    Ibaraki, T
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 1997, 1350 : 1 - 1
  • [43] The merits of a parallel genetic algorithm in solving hard optimization problems
    van Soest, AJK
    Casius, LJRR
    JOURNAL OF BIOMECHANICAL ENGINEERING-TRANSACTIONS OF THE ASME, 2003, 125 (01): : 141 - 146
  • [44] A parallel algorithm for solving hard Tsume-Shogi problems
    Nakayama, Y
    Akazawa, T
    Noshita, K
    ICCA JOURNAL, 1996, 19 (02): : 94 - 99
  • [45] Solving the hard knapsack problems with a binary particle swarm approach
    Ye, Bin
    Sun, Jun
    Xu, Wen-Bo
    COMPUTATIONAL INTELLIGENCE AND BIOINFORMATICS, PT 3, PROCEEDINGS, 2006, 4115 : 155 - 163
  • [46] Solving the hard-to-pump problems in the pulp & paper industry
    Discflo Corp, El Cajon, United States
    IPPTA, (1-16):
  • [47] Simulated annealing method for solving hard constrained optimization problems
    Chen, XD
    Zhang, HY
    Zhang, ML
    Ni, GZ
    Yang, SY
    PROCEEDINGS OF THE FOURTH INTERNATIONAL CONFERENCE ON ELECTROMAGNETIC FIELD PROBLEMS AND APPLICATIONS, 2000, : 59 - 61
  • [48] Intelligent sieve algorithms and tests for solving the hard problems on lattice
    Zhu S.
    Han Y.
    Yang X.
    Huazhong Keji Daxue Xuebao (Ziran Kexue Ban)/Journal of Huazhong University of Science and Technology (Natural Science Edition), 2021, 49 (02): : 37 - 43
  • [49] Solving the hard-to-pump problems in the pulp & paper industry
    Benson, S
    Pacello, J
    ENGINEERING & PAPERMAKERS: FORMING BONDS FOR BETTER PAPERMAKING, BOOKS 1-3, 1997, : 627 - 638
  • [50] Efficient genetic algorithms for solving hard constrained optimization problems
    Sareni, B
    Krähenbühl, L
    Nicolas, A
    IEEE TRANSACTIONS ON MAGNETICS, 2000, 36 (04) : 1027 - 1030
12345