Sciweavers

1941 search results - page 245 / 389
» On the Hardness of Approximate Reasoning
Sort
View
CN
2004
84views more  CN 2004»
15 years 6 months ago
A parameter based admission control for differentiated services networks
The Differentiated Services architecture targets at providing scalable network Quality of Service by means of aggregate scheduling. However, the defined framework itself only give...
Markus Fidler, Volker Sander
IJPRAI
2002
93views more  IJPRAI 2002»
15 years 6 months ago
Improving Stability of Decision Trees
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...
Mark Last, Oded Maimon, Einat Minkov
KI
2010
Springer
15 years 4 months ago
Soft Evidential Update via Markov Chain Monte Carlo Inference
The key task in probabilistic reasoning is to appropriately update one’s beliefs as one obtains new information in the form of evidence. In many application settings, however, th...
Dominik Jain, Michael Beetz
PRIS
2010
15 years 4 months ago
The Impact of Pre-processing on the Classification of MEDLINE Documents
The amount of information available in the MEDLINE database makes it very hard for a researcher to retrieve a reasonable amount of relevant documents using a simple query language ...
Carlos Adriano Gonçalves, Célia Talm...
SASO
2010
IEEE
15 years 4 months ago
Extracting Overlay Invariants of Distributed Systems for Autonomic System Management
Many large-scale distributed systems have been built with great complexity to run Internet services. Due to the heterogeneity and dynamics of complex systems, it is very difficult ...
Hanhuai Shan, Guofei Jiang, Kenji Yoshihira