A LOWER BOUND FOR PROBABILISTIC ALGORITHMS FOR FINITE STATE MACHINES

被引:26
|
作者
GREENBERG, AG
WEISS, A
机构
关键词
D O I
10.1016/0022-0000(86)90045-0
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:88 / 105
页数:18
相关论文
共 50 条
  • [21] Toward Occlusion Handling in Visual Tracking via Probabilistic Finite State Machines
    Liu, Chenghuan
    Huynh, Du Q.
    Reynolds, Mark
    IEEE TRANSACTIONS ON CYBERNETICS, 2020, 50 (04) : 1726 - 1738
  • [22] Probabilistic Behavioural State Machines
    Novak, Peter
    PROGRAMMING MULTI-AGENT SYSTEMS, 2010, 5919 : 67 - 81
  • [23] Maneuver recognition using Probabilistic Finite-State Machines and Fuzzy Logic
    Huelnhagen, Till
    Dengler, Ingo
    Tamke, Andreas
    Dang, Thao
    Breuel, Gabi
    2010 IEEE INTELLIGENT VEHICLES SYMPOSIUM (IV), 2010, : 65 - 70
  • [24] A Finite-Sample, Distribution-Free, Probabilistic Lower Bound on Mutual Information
    VanderKraats, Nathan D.
    Banerjee, Arunava
    NEURAL COMPUTATION, 2011, 23 (07) : 1862 - 1898
  • [25] Finite state machines
    Carter, J
    POWER ENGINEERING JOURNAL, 2001, 15 (01): : 15 - 15
  • [26] Finite state machines
    Jonsson, B
    MODEL-BASED TESTING OF REACTIVE SYSTEMS, 2005, 3472 : 611 - 614
  • [27] LOWER BOUND ON PROBABILITY OF DECODING ERROR FOR FINITE-STATE CHANNEL
    KIEFFER, JC
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1974, 20 (04) : 549 - 551
  • [28] A lower bound on the feedback capacity of finite-state ISI channels
    Yang, SH
    Kavcic, A
    2002 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-5, CONFERENCE PROCEEDINGS, 2002, : 1574 - 1578
  • [29] TEST FUNCTION EMBEDDING ALGORITHMS WITH APPLICATION TO INTERCONNECTED FINITE-STATE MACHINES
    KANJILAL, S
    CHAKRADHAR, ST
    AGRAWAL, VD
    IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 1995, 14 (09) : 1115 - 1127
  • [30] Solving identification problem for asynchronous finite state machines using genetic algorithms
    Geng, Xiaojun
    GECCO 2006: GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, VOL 1 AND 2, 2006, : 1413 - 1414