Convergence Results for Ant Routing Algorithms via Stochastic Approximation

ACM Transactions on Autonomous and Adaptive Systems - United States
doi 10.1145/2451248.2451251
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Association for Computing Machinery (ACM)

Related search

Approximation Algorithms for Multiconstrained Quality-Of-Service Routing

IEEE Transactions on Computers
HardwareArchitectureMathematicsComputational TheoryTheoretical Computer ScienceSoftware
2006English

Convergence and Approximation Results for Measurable Multifunctions

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1987English

Improved Approximation Results for Stochastic Knapsack Problems

2011English

Enhancing Security via Stochastic Routing

English

Adaptive Algorithms for Routing and Traffic Engineering in Stochastic Networks

English

Korovkin Type Approximation Theorems via Lacunary Equistatistical Convergence

Filomat
Mathematics
2016English

Simulation Optimization via Simultaneous Perturbation Stochastic Approximation

English

On the Convergence of Stochastic Iterative Dynamic Programming Algorithms

Neural Computation
ArtsCognitive NeuroscienceHumanities
1994English

On the Convergence of Stochastic Iterative Dynamic Programming Algorithms

1993English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy