Sciweavers

1147 search results - page 67 / 230
» Statistical Timing Analysis Using Bounds
Sort
View
ECRTS
2010
IEEE
13 years 10 months ago
Precise and Efficient FIFO-Replacement Analysis Based on Static Phase Detection
Schedulability analysis for hard real-time systems requires bounds on the execution times of its tasks. To obtain useful bounds in the presence of caches, static timing analyses mu...
Daniel Grund, Jan Reineke
CPM
2000
Springer
141views Combinatorics» more  CPM 2000»
14 years 15 days ago
A Lower Bound for the Breakpoint Phylogeny Problem
Breakpoint phylogenies methods have been shown to be an effective way to extract phylogenetic information from gene order data. Currently, the only practical breakpoint phylogeny a...
David Bryant
COCOON
2001
Springer
14 years 1 months ago
Decidable Approximations on Generalized and Parameterized Discrete Timed Automata
We consider generalized discrete timed automata with general linear relations over clocks and parameterized constants as clock constraints and with parameterized durations. We look...
Zhe Dang, Oscar H. Ibarra, Richard A. Kemmerer
APVIS
2007
13 years 10 months ago
Visualization of sanitized email logs for spam analysis
Email has become an integral method of communication. However, it is still plagued by vast amounts of spam. Many statistical techniques, such as Bayesian filtering, have been app...
Chris Muelder, Kwan-Liu Ma
ESA
2008
Springer
153views Algorithms» more  ESA 2008»
13 years 10 months ago
A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling
We devise the first constant-approximate feasibility test for sporadic multiprocessor real-time scheduling. We give an algorithm that, given a task system and > 0, correctly de...
Vincenzo Bonifaci, Alberto Marchetti-Spaccamela, S...