Sciweavers

958 search results - page 22 / 192
» Resolving the Micropayment Problem
Sort
View
LISA
2007
15 years 4 days ago
PDA: A Tool for Automated Problem Determination
Problem determination remains one of the most expensive and time-consuming functions in system management due to the difficulty in automating what is essentially a highly experien...
Hai Huang, Raymond B. Jennings III, Yaoping Ruan, ...
ESEM
2009
ACM
15 years 1 months ago
An empirical study of security problem reports in Linux distributions
Existing studies on problem reports in open source projects focus primarily on the analysis of the general category of problem reports, or limit their attention to observations on...
Prasanth Anbalagan, Mladen A. Vouk
ESA
2003
Springer
189views Algorithms» more  ESA 2003»
15 years 3 months ago
On the Complexity of Approximating TSP with Neighborhoods and Related Problems
We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be efficiently approximated to within any constant factor unless P = NP. This ...
Shmuel Safra, Oded Schwartz
CSFW
2011
IEEE
13 years 9 months ago
The Complexity of Quantitative Information Flow Problems
—In this paper, we investigate the computational complexity of quantitative information flow (QIF) problems. Information-theoretic quantitative relaxations of noninterference (b...
Pavol Cerný, Krishnendu Chatterjee, Thomas ...
ICAC
2005
IEEE
15 years 3 months ago
Quickly Finding Known Software Problems via Automated Symptom Matching
We present an architecture for and prototype of a system for quickly detecting software problem recurrences. Re-discovery of the same problem is very common in many large software...
Mark Brodie, Sheng Ma, Guy M. Lohman, Laurent Mign...