Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
28
click to vote
TECS
2010
favorite
Email
discuss
report
62
views
more
TECS 2010
»
Tightening the bounds on feasible preemptions
13 years 5 months ago
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
more »
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)
Researcher Info
TECS 2008 Study Group
Computer Vision