86 search results - page 5 / 18 » Predicting the Performance of IDA* with Conditional Distribu... |
ASMTA
2011
Springer
12 years 11 months ago
2011
Springer
Queueing delays experienced by packets buffered at a node are among the most difficult to predict when considering the performance of a flow in a network. The arrivals of packets a...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
We bound the future loss when predicting any (computably) stochastic sequence online. Solomonoff finitely bounded the total deviation of his universal predictor M from the true d...
IPPS
2002
IEEE
14 years 9 days ago
2002
IEEE
The goal of this research is to develop performance profiles of parallel and distributed applications in order to predict their execution time under different network conditions....
CORR
2006
Springer
13 years 7 months ago
2006
Springer
The decision tree is one of the most fundamental ing abstractions. A commonly used type of decision tree is the alphabetic binary tree, which uses (without loss of generality) &quo...
CIKM
2011
Springer
12 years 7 months ago
2011
Springer
This paper explores correspondence and mixture topic modeling of documents tagged from two different perspectives. There has been ongoing work in topic modeling of documents with...