"A Fully Polynomial-Time Approximation Scheme for Feasibility Analysis in ..."

Nathan Fisher, Sanjoy K. Baruah (2005)

> Home

Details and statistics

DOI: 10.1109/ECRTS.2005.1

access: closed

type: Conference or Workshop Paper

metadata version: 2023-03-23

- view
  authority control:
- export record
  dblp key:
  - conf/ecrts/FisherB05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ecrts/FisherB05
Nathan Fisher, Sanjoy K. Baruah:
A Fully Polynomial-Time Approximation Scheme for Feasibility Analysis in Static-Priority Systems with Arbitrary Relative Deadlines. ECRTS 2005: 117-126

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.