Sciweavers

1688 search results - page 314 / 338
» Implementing Optimizations at Decode Time
Sort
View
KRDB
1998
93views Database» more  KRDB 1998»
13 years 9 months ago
Intelligent Caching for Information Mediators: A KR Based Approach
We present a semantic caching approach for optimizing the performance of information mediators. A critical problem with information mediators, particularly those gathering and int...
Naveen Ashish, Craig A. Knoblock, Cyrus Shahabi
CORR
2010
Springer
162views Education» more  CORR 2010»
13 years 8 months ago
Random sampling of lattice paths with constraints, via transportation
We investigate Monte Carlo Markov Chain (MCMC) procedures for the random sampling of some one-dimensional lattice paths with constraints, for various constraints. We will see that...
Lucas Gerin
CN
2006
116views more  CN 2006»
13 years 8 months ago
Techniques for available bandwidth measurement in IP networks: A performance comparison
As the Internet grows in scale and complexity, the need for accurate traffic measurement increases. Among the different parameters relevant to traffic measurement, the paper pays ...
Leopoldo Angrisani, Salvatore D'Antonio, Marcello ...
TON
2008
138views more  TON 2008»
13 years 7 months ago
On the performance benefits of multihoming route control
Multihoming is increasingly being employed by large enterprises and data centers to extract good performance and reliability from their ISP connections. Multihomed end networks tod...
Aditya Akella, Bruce M. Maggs, Srinivasan Seshan, ...
ENTCS
2002
90views more  ENTCS 2002»
13 years 7 months ago
Inorder traversal of splay trees
Splay trees, a form of self-adjusting binary tree, were introduced by Sleator and Tarjan in the early 1980s. Their main use is to store ordered lists. The idea is to keep the tree...
Colm Ó'Dúnlaing