Sciweavers

1391 search results - page 35 / 279
» Complexity Limitations on Quantum Computation
Sort
View
RTS
2011
123views more  RTS 2011»
13 years 2 months ago
Feasibility analysis under fixed priority scheduling with limited preemptions
—Preemptive scheduling often generates a significant runtime overhead that may increase task worst-case execution times up to 40%, with respect to a fully non preemptive executi...
Gang Yao, Giorgio C. Buttazzo, Marko Bertogna
PIMRC
2008
IEEE
14 years 2 months ago
Increasing SIP firewall performance by ruleset size limitation
Abstract— To protect SIP communication networks from attacks, especially flooding attacks like Denial-of-Service or message spam, Intrusion Detection Systems (IDS) are deployed ...
Sven Ehlert, Ge Zhang, Thomas Magedanz
EICS
2010
ACM
14 years 24 days ago
User interface plasticity: model driven engineering to the limit!
Ten years ago, I introduced the notion of user interface plasticity to denote the capacity of user interfaces to adapt, or to be adapted, to the context of use while preserving us...
Joëlle Coutaz
ATAL
2008
Springer
13 years 9 months ago
Resource limitations, transmission costs and critical thresholds in scale-free networks
Whether or not a critical threshold exists when epidemic diseases are spread in complex networks is a problem attracting attention from researchers in several disciplines. In 2001...
Chung-Yuan Huang, Chuen-Tsai Sun, Chia-Ying Cheng,...
SODA
2010
ACM
200views Algorithms» more  SODA 2010»
14 years 5 months ago
Algorithms for ray class groups and Hilbert class fields
This paper analyzes the complexity of problems from class field theory. Class field theory can be used to show the existence of infinite families of number fields with constant ro...
Sean Hallgren, Kirsten Eisentraeger