Sciweavers

3934 search results - page 227 / 787
» Approximate Schedulability Analysis
Sort
View
FLAIRS
2010
15 years 4 months ago
Decision-Theoretic Simulated Annealing
The choice of a good annealing schedule is necessary for good performance of simulated annealing for combinatorial optimization problems. In this paper, we pose the simulated anne...
Todd W. Neller, Christopher J. La Pilla
DATE
2010
IEEE
149views Hardware» more  DATE 2010»
15 years 11 months ago
Integrated end-to-end timing analysis of networked AUTOSAR-compliant systems
—As Electronic Control Units (ECUs) and embedded software functions within an automobile keep increasing in number, the scale and complexity of automotive embedded systems is gro...
Karthik Lakshmanan, Gaurav Bhatia, Ragunathan Rajk...
CORR
2004
Springer
105views Education» more  CORR 2004»
15 years 6 months ago
A Grid-enabled Interface to Condor for Interactive Analysis on Handheld and Resource-limited Devices
This paper presents the design and implementation of a Grid-enabled interactive analysis environment for handheld and other resource-limited computing devices. Handheld devices ar...
Arshad Ali, Ashiq Anjum, Tahir Azim, Julian J. Bun...
ECRTS
2005
IEEE
16 years 4 days ago
Fast and Tight Response-Times for Tasks with Offsets
In previous work, we presented a tight approximate response-time analysis for tasks with offsets. While providing a tight bound on response times, the tight analysis exhibits simi...
Jukka Mäki-Turja, Mikael Nolin
STOC
2007
ACM
119views Algorithms» more  STOC 2007»
16 years 6 months ago
Balanced max 2-sat might not be the hardest
We show that, assuming the Unique Games Conjecture, it is NPhard to approximate MAX 2-SAT within LLZ + , where 0.9401 < LLZ < 0.9402 is the believed approximation ratio of t...
Per Austrin