Sciweavers

1369 search results - page 183 / 274
» A Practical Implementation of the Timing Attack
Sort
View
NDSS
2006
IEEE
15 years 5 months ago
Software Self-Healing Using Collaborative Application Communities
Software monocultures are usually considered dangerous because their size and uniformity represent the potential for costly and widespread damage. The emerging concept of collabor...
Michael E. Locasto, Stelios Sidiroglou, Angelos D....
CCO
2001
Springer
143views Combinatorics» more  CCO 2001»
15 years 3 months ago
TSP Cuts Which Do Not Conform to the Template Paradigm
Abstract. The first computer implementation of the Dantzig-FulkersonJohnson cutting-plane method for solving the traveling salesman problem, written by Martin, used subtour inequa...
David Applegate, Robert E. Bixby, Vasek Chvá...
TPDS
2008
92views more  TPDS 2008»
14 years 11 months ago
Max-Min Fair Scheduling in Input-Queued Switches
Fairness in traffic management can improve the isolation between traffic streams, offer a more predictable performance, eliminate transient bottlenecks, mitigate the effect of cer...
Madhusudan Hosaagrahara, Harish Sethu
OSDI
2002
ACM
15 years 11 months ago
CMC: A Pragmatic Approach to Model Checking Real Code
Many system errors do not emerge unless some intricate sequence of events occurs. In practice, this means that most systems have errors that only trigger after days or weeks of ex...
Madanlal Musuvathi, David Y. W. Park, Andy Chou, D...
SMALLTALK
2007
Springer
15 years 5 months ago
Transactional memory for smalltalk
Concurrency control in Smalltalk is based on locks and is therefore notoriously difficult to use. Even though some implementations provide high-level constructs, these add complexi...
Lukas Renggli, Oscar Nierstrasz