<i>N</i>-gram distribution and unification gain problem and its optimal solution (Q5252925): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Optimal search path for service in the presence of disruptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Financing policies via stochastic control: a dynamic programming approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision support for supply chain planning under uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved algorithms for the \(k\) simple shortest paths and the replacement paths problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrated planning problem in supply chains with time-varying delivery / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crop succession requirements in agricultural production planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Differential evolution and differential ant-stigmergy on dynamic optimisation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient time and space \(K\) point-to-point shortest simple paths algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic programming and minimum risk paths / rank
 
Normal rank

Latest revision as of 04:54, 10 July 2024

scientific article; zbMATH DE number 6442574
Language Label Description Also known as
English
<i>N</i>-gram distribution and unification gain problem and its optimal solution
scientific article; zbMATH DE number 6442574

    Statements

    Identifiers