Sciweavers

1723 search results - page 236 / 345
» Predicting the Performance of IDA* using Conditional Distrib...
Sort
View
SIGSOFT
2007
ACM
16 years 4 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...
COMCOM
2007
84views more  COMCOM 2007»
15 years 4 months ago
A user-focused evaluation of web prefetching algorithms
Web prefetching mechanisms have been proposed to benefit web users by hiding the download latencies. Nevertheless, to the knowledge of the authors, there is no attempt to compare...
Josep Domènech, Ana Pont, Julio Sahuquillo,...
KDD
2012
ACM
201views Data Mining» more  KDD 2012»
13 years 6 months ago
Learning from crowds in the presence of schools of thought
Crowdsourcing has recently become popular among machine learning researchers and social scientists as an effective way to collect large-scale experimental data from distributed w...
Yuandong Tian, Jun Zhu
INFOCOM
2005
IEEE
15 years 9 months ago
Joint optimal scheduling and routing for maximum network throughput
— In this paper we consider packet networks loaded by admissible traffic patterns, i.e. by traffic patterns that, if optimally routed, do not overload network resources. In the...
Emilio Leonardi, Marco Mellia, Marco Ajmone Marsan...
SWS
2004
ACM
15 years 9 months ago
Trust but verify: authorization for web services
Through web service technology, distributed applications can be built in a exible manner, bringing tremendous power to applications on the web. However, this exibility poses sig...
Christian Skalka, Xiaoyang Sean Wang