1450 search results - page 178 / 290 » On the Complexity of Hardness Amplification |
CN
2004
13 years 9 months ago
2004
One of the important issues in the design of future generation of high-speed networks is to provide differentiated service to different types of traffic with various time constrai...
COMCOM
2004
13 years 9 months ago
2004
One of the important issues in the design of future generation high-speed networks is to provide differentiated services to different types of applications with various time const...
ENTCS
2000
13 years 9 months ago
2000
Incompleteness results for behavioral logics are investigated. We show that there is a basic finite behavioral specification for which the behavioral satisfaction problem is not r...
CORR
2007
Springer
13 years 9 months ago
2007
Springer
— Measuring network flow sizes is important for tasks like accounting/billing, network forensics and security. Per-flow accounting is considered hard because it requires that m...
IJPRAI
2002
13 years 9 months ago
2002
Decision-tree algorithms are known to be unstable: small variations in the training set can result in different trees and different predictions for the same validation examples. B...