-gram distribution and unification gain problem and its optimal solution

Dong Huang, Xiaolong Wang, Ronggang Dou, Shiwen Liu and Jia Fang

International Journal of Systems Science, 2015, vol. 46, issue 7, 1327-1336

Abstract: N-gram distribution and unification gain is a type of problem in which objects obtain gain after a series of regular actions, such as ‘distributions’ and ‘unifications’. The uncertainty return forms of the gain lead to the complexity of the whole gain process in the problem we propose. The gain path is usually concurrent and consecutive to the timeline in practice; thus, we are unable to solve the problem and obtain the optimal path or overall gain at a certain time using the optimal path algorithm alone. Therefore, the N-gram distribution and unification gain model, which utilises a new dynamic programming algorithm in solving problems, is proposed. This procedure facilitates the solving of similar comprehensive gain problems and obtaining important information, such as the optimal gain path and the overall gain.

Date: 2015
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1080/00207721.2013.822608 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:taf:tsysxx:v:46:y:2015:i:7:p:1327-1336

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/TSYS20

DOI: 10.1080/00207721.2013.822608

Access Statistics for this article

International Journal of Systems Science is currently edited by Visakan Kadirkamanathan

More articles in International Journal of Systems Science from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().