"A fully polynomial-time approximation scheme for feasibility analysis in ..."

Nathan Fisher, Sanjoy K. Baruah (2006)

> Home

Details and statistics

DOI: —

access: closed

type: Journal Article

metadata version: 2020-08-07

- view
  - electronic edition @ iospress.com
- export record
  dblp key:
  - journals/jec/FisherB06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jec/FisherB06
Nathan Fisher, Sanjoy K. Baruah:
A fully polynomial-time approximation scheme for feasibility analysis in static-priority systems with bounded relative deadlines. J. Embed. Comput. 2(3-4): 291-299 (2006)

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.