Perfect periodic scheduling for binary tree routing in wireless networks (Q319999): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2015.05.031 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W592494983 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Wireless mesh networks: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Service and Operation Costs of Periodic Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for periodic scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearly optimal perfectly periodic schedules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dispatching in perfectly-periodic schedules / rank
 
Normal rank
Property / cites work
 
Property / cites work: General perfectly periodic scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial algorithm for the TDMA message scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elementary Number Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect periodic scheduling for three basic cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate dynamic programming for link scheduling in wireless mesh networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive general perfectly periodic scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Energy efficient spatial TDMA scheduling in wireless networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arbitrary Throughput Versus Complexity Tradeoffs in Wireless Networks Using Graph Partitioning / rank
 
Normal rank

Latest revision as of 15:47, 12 July 2024

scientific article
Language Label Description Also known as
English
Perfect periodic scheduling for binary tree routing in wireless networks
scientific article

    Statements

    Perfect periodic scheduling for binary tree routing in wireless networks (English)
    0 references
    0 references
    0 references
    6 October 2016
    0 references
    scheduling
    0 references
    OR in telecommunications
    0 references
    mobile and ad hoc networks (MANETs)
    0 references
    combinatorial optimization
    0 references
    Chinese remainder theorem
    0 references

    Identifiers