A new LP formulation of the admission control problem modelled as an MDP under average reward criterion (Q4909045): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q58489649 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: LPbook / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/00207721003717289 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2074555203 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Admission control in UMTS networks based on approximate dynamic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Alternative LP Formulation of the Admission Control Problem in Multiclass Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5485393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reinforcement learning for call admission control and routing under quality of Service constraints in multimedia networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cross-Layer optimal connection admission control for variable bit rate multimedia traffic in packet wireless CDMA networks / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 06:05, 6 July 2024

scientific article; zbMATH DE number 6143365
Language Label Description Also known as
English
A new LP formulation of the admission control problem modelled as an MDP under average reward criterion
scientific article; zbMATH DE number 6143365

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references