Derivation of on-line algorithms, with an application to finding palindromes

被引：0
|
作者：
Jeuring, Johan [1 ]
机构：
[1] Utrecht Univ, Utrecht, Netherlands
来源：
Algorithmica (New York) | 1994年 / 11卷 / 02期
关键词：
Bird meertens calculus - Palindromes - Segment problems - Theory of lists - Transformational programming;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
页码：146 / 184
相关论文
共 50 条
  • [1] THE DERIVATION OF ONLINE ALGORITHMS, WITH AN APPLICATION TO FINDING PALINDROMES
    JEURING, J
    ALGORITHMICA, 1994, 11 (02) : 146 - 184
  • [2] Signal-flow-graph derivation of on-line gradient learning algorithms
    Campolucci, P
    Marchegiani, A
    Uncini, A
    Piazza, F
    1997 IEEE INTERNATIONAL CONFERENCE ON NEURAL NETWORKS, VOLS 1-4, 1997, : 1884 - 1889
  • [3] Finding death on-line
    Brower, V
    NATURE MEDICINE, 1996, 2 (09) : 954 - 954
  • [4] Finding on-line resources
    Busby, B
    HEALTH PHYSICS, 1998, 74 (04): : 417 - 418
  • [5] A genetic algorithms for on-line calculation with application to system theory
    Lee, H. G.
    Hong, J. M.
    Kang, H.
    Sim, K. B.
    2009 IEEE INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS, VOLS 1-3, 2009, : 2180 - 2182
  • [6] On-line algorithms for orders
    Bouchitte, V
    Rampon, JX
    THEORETICAL COMPUTER SCIENCE, 1997, 175 (02) : 225 - 238
  • [7] Execution time enhancement of DOCR coordination algorithms for on-line application
    Gutierrez, E. H.
    Conde, A.
    Shih, M. Y.
    Fernandez, Erika
    ELECTRIC POWER SYSTEMS RESEARCH, 2019, 170 : 1 - 12
  • [8] Generalized Exponentiated Gradient Algorithms and Their Application to On-Line Portfolio Selection
    Cichocki, Andrzej
    Cruces, Sergio
    Sarmiento, Auxiliadora
    Tanaka, Toshihisa
    IEEE ACCESS, 2024, 12 : 197000 - 197020
  • [9] Finding Gapped Palindromes Online
    Fujishige, Yuta
    Nakamura, Michitaro
    Inenaga, Shunsuke
    Bannai, Hideo
    Takeda, Masayuki
    Combinatorial Algorithms, 2016, 9843 : 191 - 202
  • [10] Finding approximate palindromes in strings
    Porto, AHL
    Barbosa, VC
    PATTERN RECOGNITION, 2002, 35 (11) : 2581 - 2591
12345