Sciweavers

1389 search results - page 143 / 278
» Predicting and Evaluating Distributed Communication Performa...
Sort
View
SIGIR
2005
ACM
15 years 10 months ago
The maximum entropy method for analyzing retrieval measures
We present a model, based on the maximum entropy method, for analyzing various measures of retrieval performance such as average precision, R-precision, and precision-at-cutoffs....
Javed A. Aslam, Emine Yilmaz, Virgiliu Pavlu
HPDC
2002
IEEE
15 years 9 months ago
IQ-RUDP: Coordinating Application Adaptation with Network Transport
Our research addresses the efficient transfer of large data across wide-area networks, focusing on applications like remote visualization and real-time collaboration. To attain h...
Qi He, Karsten Schwan
ISCA
1999
IEEE
95views Hardware» more  ISCA 1999»
15 years 8 months ago
Memory Sharing Predictor: The Key to a Speculative Coherent DSM
Recent research advocates using general message predictors to learn and predict the coherence activity in distributed shared memory (DSM). By accurately predicting a message and t...
An-Chow Lai, Babak Falsafi
UMUAI
1998
157views more  UMUAI 1998»
15 years 4 months ago
Bayesian Models for Keyhole Plan Recognition in an Adventure Game
We present an approach to keyhole plan recognition which uses a dynamic belief (Bayesian) network to represent features of the domain that are needed to identify users’ plans and...
David W. Albrecht, Ingrid Zukerman, Ann E. Nichols...
SIGMETRICS
2011
ACM
229views Hardware» more  SIGMETRICS 2011»
14 years 7 months ago
Model-driven optimization of opportunistic routing
Opportunistic routing aims to improve wireless performance by exploiting communication opportunities arising by chance. A key challenge in opportunistic routing is how to achieve ...
Eric Rozner, Mi Kyung Han, Lili Qiu, Yin Zhang