N-gram distribution and unification gain problem and its optimal solution

DOI10.1080/00207721.2013.822608zbMath1312.93113OpenAlexW2122490900MaRDI QIDQ5252925

Dong Huang, Shiwen Liu, Jia Fang, Ronggang Dou, Xiao-Long Wang

Publication date: 3 June 2015

Published in: International Journal of Systems Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207721.2013.822608

zbMATH Keywords

dynamic programmingoptimal pathgaindistribution and unification

Mathematics Subject Classification ID

Dynamic programming (90C39) Optimal stochastic control (93E20)

Cites Work

• A note on two problems in connexion with graphs
• An efficient time and space \(K\) point-to-point shortest simple paths algorithm
• Financing policies via stochastic control: a dynamic programming approach
• Optimal search path for service in the presence of disruptions
• Improved algorithms for the \(k\) simple shortest paths and the replacement paths problems
• Crop succession requirements in agricultural production planning
• Dynamic programming and minimum risk paths
• Differential evolution and differential ant-stigmergy on dynamic optimisation problems
• Integrated planning problem in supply chains with time-varying delivery
• Decision support for supply chain planning under uncertainty

This page was built for publication: N-gram distribution and unification gain problem and its optimal solution