Sciweavers

800 search results - page 6 / 160
» Effective Prediction and its Computational Complexity
Sort
View
CORR
2007
Springer
169views Education» more  CORR 2007»
13 years 7 months ago
Algorithmic Complexity Bounds on Future Prediction Errors
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...
Alexey V. Chernov, Marcus Hutter, Jürgen Schm...
KDD
2007
ACM
165views Data Mining» more  KDD 2007»
14 years 7 months ago
Efficient and effective explanation of change in hierarchical summaries
Dimension attributes in data warehouses are typically hierarchical (e.g., geographic locations in sales data, URLs in Web traffic logs). OLAP tools are used to summarize the measu...
Deepak Agarwal, Dhiman Barman, Dimitrios Gunopulos...
ICNP
2000
IEEE
13 years 11 months ago
Differentiated Predictive Fair Service for TCP Flows
The majority of the traffic (bytes) flowing over the Internet today have been attributed to the Transmission Control Protocol (TCP). This strong presence of TCP has recently spu...
Ibrahim Matta, Liang Guo
SIGSOFT
2007
ACM
14 years 8 months ago
Measuring empirical computational complexity
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...
Simon Goldsmith, Alex Aiken, Daniel Shawcross Wilk...
ATAL
2004
Springer
14 years 23 days ago
Degree of Local Cooperation and Its Implication on Global Utility
In a cooperative multi-agent system that is situated in an evolving environment, agents need to dynamically adjust their negotiation attitudes towards different agents in order to...
Jiaying Shen, Xiaoqin Zhang, Victor R. Lesser