On the public citation graph
An efficient pursuit automata approach for estimating stable all‐pairs shortest paths in stochastic network environments
0 signed · 49 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/dac.684openalex-snapshot
GPSPA: a new adaptive algorithm for maintaining shortest path routing trees in stochastic networks
inferredcites →https://doi.org/10.1006/jcss.1997.1493openalex-snapshot
Faster Shortest-Path Algorithms for Planar Graphs
inferredcites →https://doi.org/10.1007/978-1-4419-9052-5openalex-snapshot
Networks of Learning Automata: Techniques for Online Stochastic Optimization
inferredcites →https://doi.org/10.1007/978-1-4612-5975-6openalex-snapshot
Learning Algorithms Theory and Applications
inferredcites →https://doi.org/10.1007/978-94-010-0324-7_25openalex-snapshot
The Use of Reinforcement Learning Algorithms in Traffic Control of High Speed Networks
inferredcites →https://doi.org/10.1007/bf01386390openalex-snapshot
A note on two problems in connexion with graphs
inferredcites →https://doi.org/10.1007/bfb0015102openalex-snapshot
Learning Automata and Stochastic Optimization
inferredcites →https://doi.org/10.1007/bfb0023446openalex-snapshot
Semi-dynamic shortest paths and breadth-first search in digraphs
inferredcites →https://doi.org/10.1007/bfb0024016openalex-snapshot
A dynamization of the All Pairs Least Cost Path Problem
inferredcites →https://doi.org/10.1016/0041-5553(68)90148-1openalex-snapshot
The parametric problem of shortest distances
inferredcites →https://doi.org/10.1016/0196-6774(91)90036-xopenalex-snapshot
Incremental algorithms for minimal length paths
inferredcites →https://doi.org/10.1016/0304-3975(95)00079-8openalex-snapshot
On the computational complexity of dynamic graph problems
inferredcites →https://doi.org/10.1016/s0020-0255(03)00179-8openalex-snapshot
Efficient fast learning automata
inferredcites →https://doi.org/10.1016/s0129-0657(02)00090-xopenalex-snapshot
NEW LEARNING AUTOMATA BASED ALGORITHMS FOR ADAPTATION OF BACKPROPAGATION ALGORITHM PARAMETERS
inferredcites →https://doi.org/10.1016/s0140-3664(00)00345-5openalex-snapshot
Computer Networks: A Systems Approach
inferredcites →https://doi.org/10.1016/s0377-2217(97)00342-1openalex-snapshot
Distributed scheduling using simple learning machines
inferredcites →https://doi.org/10.1016/s1389-1286(00)00090-6openalex-snapshot
The use of learning algorithms in ATM networks call admission control problem: a methodology
inferredcites →https://doi.org/10.1109/4234.831040openalex-snapshot
Learning-automata-based TDMA protocols for broadcast communication systems with bursty traffic
inferredcites →https://doi.org/10.1109/90.893870openalex-snapshot
New dynamic algorithms for shortest path tree computation
inferredcites →https://doi.org/10.1109/itcc.2004.1286725openalex-snapshot
Applying continuous action reinforcement learning automata(CARLA) to global training of hidden Markov models
inferredcites →https://doi.org/10.1109/sfcs.2001.959897openalex-snapshot
Planar graphs, negative weight edges, shortest paths, and near linear time
inferredcites →https://doi.org/10.1109/sfcs.2001.959900openalex-snapshot
Fully dynamic all pairs shortest paths with real edge weights
inferredcites →https://doi.org/10.1109/sffcs.1999.814580openalex-snapshot
Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs
inferredcites →https://doi.org/10.1109/tcom.1980.1094690openalex-snapshot
Routing Techniques Used in Computer Communication Networks
inferredcites →https://doi.org/10.1109/tcom.1980.1094721openalex-snapshot
The New Routing Algorithm for the ARPANET
inferredcites →https://doi.org/10.1109/tsmcb.2002.1049604openalex-snapshot
Guest editorial learning automata: theory, paradigms, and applications
inferredcites →https://doi.org/10.1109/tsmcb.2002.1049608openalex-snapshot
Generalized pursuit learning schemes: new families of continuous and discretized learning automata
inferredcites →https://doi.org/10.1109/tsmcb.2002.1049615openalex-snapshot
Learning automata-based bus arbitration for shared-medium ATM switches
inferredcites →https://doi.org/10.1109/tsmcc.2003.817354openalex-snapshot
Optimizing qos routing in hierarchical atm networks using computational intelligence techniques
inferredcites →https://doi.org/10.1137/0204032openalex-snapshot
On Finding and Updating Spanning Trees and Shortest Paths
inferredcites →https://doi.org/10.1145/780542.780567openalex-snapshot
A new approach to dynamic all pairs shortest paths
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/sec.200openalex-snapshot
A stochastic learning automata‐based solution for intrusion detection in vehicularad hocnetworks
inferred← citeshttps://doi.org/10.1007/s00500-017-2839-5openalex-snapshot
Distributed task allocation in multi-agent environments using cellular learning automata
inferred← citeshttps://doi.org/10.1007/s11227-011-0639-8openalex-snapshot
A learning automata-based fault-tolerant routing algorithm for mobile ad hoc networks
inferred← citeshttps://doi.org/10.1007/s11277-009-9883-0openalex-snapshot
An Adaptive Learning Scheme for Medium Access with Channel Reservation in Wireless Networks
inferred← citeshttps://doi.org/10.1016/j.engappai.2018.10.013openalex-snapshot
GAPN-LA: A framework for solving graph problems using Petri nets and learning automata
inferred← citeshttps://doi.org/10.1016/j.jnca.2010.07.002openalex-snapshot
Policy controlled self-configuration in unattended wireless sensor networks
inferred← citeshttps://doi.org/10.1016/j.knosys.2020.106638openalex-snapshot
A sampling method based on distributed learning automata for solving stochastic shortest path problem
inferred← citeshttps://doi.org/10.1080/01969722.2015.1082407openalex-snapshot
Finding Minimum Vertex Covering in Stochastic Graphs: A Learning Automata Approach
inferred← citeshttps://doi.org/10.1109/access.2020.2996279openalex-snapshot
A Learning-Automata-Based Congestion-Aware Scheme for Energy-Efficient Elastic Optical Networks
inferred← citeshttps://doi.org/10.1109/cits.2013.6705715openalex-snapshot
Learning Automata Based Sentiment Analysis for recommender system on cloud
inferred← citeshttps://doi.org/10.1109/icc.2013.6655097openalex-snapshot
A fault-tolerant routing protocol for dynamic autonomous unmanned vehicular networks
inferred← citeshttps://doi.org/10.1109/jsyst.2015.2418353openalex-snapshot
Learning Automata-Based Fault-Tolerant System for Dynamic Autonomous Unmanned Vehicular Networks
inferred← citeshttps://doi.org/10.1109/platcon.2017.7883700openalex-snapshot
Designing and Prototyping Utility Management Using Hybrid Wireless-Wired Network Technologies
inferred← citeshttps://doi.org/10.1109/tsmcb.2009.2030786openalex-snapshot
Cellular Learning Automata With Multiple Learning Automata in Each Cell and Its Applications
inferred← citeshttps://doi.org/10.22161/ijaers/nctet.2017.8openalex-snapshot
An Effective Learning Automata for Recommending Users and Locations Based On Cloud
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.