Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

96

Voted

TECS
2010

62views more TECS 2010»

Tightening the bounds on feasible preemptions

14 years 9 months ago

Tightening the bounds on feasible preemptions

Download moss.csc.ncsu.edu

Harini Ramaprasad, Frank Mueller

Real-time Traffic

TECS 2010 |

claim paper

Related Content

» Tightening the Bounds on Feasible Preemption Points

» Resilience analysis tightening the CRPD bound for setassociative caches

» FeasibilityBased Bounds Tightening via Fixed Points

» On the Convergence of Feasibility based Bounds Tightening

» Hybrid Constraint Tightening for Solving Hybrid Scheduling Problems

» Integrating Job Parallelism in RealTime Scheduling Theory

» Global Optimization of Probabilistically Constrained Linear Programs

» Facets of the Complementarity Knapsack Polytope

» A simpler and tighter redundant KleeMinty construction

Post Info
More Details (n/a)

Added	22 May 2011
Updated	22 May 2011
Type	Journal
Year	2010
Where	TECS
Authors	Harini Ramaprasad, Frank Mueller

Comments (0)