1382 search results - page 174 / 277 » Formal Analysis of Online Algorithms |
191
click to vote
IOPADS
1997
15 years 7 months ago
1997
We provide a competitive analysis framework for online prefetching and buffer management algorithms in parallel I/O systems, using a read-once model of block references. This has ...
167
click to vote
WWW
2007
ACM
16 years 7 months ago
2007
ACM
Service discovery is one of challenging issues in Service-Oriented computing. Currently, most of the existing service discovering and matching approaches are based on keywords-bas...
164
click to vote
ALT
2004
Springer
16 years 3 months ago
2004
Springer
When applying aggregating strategies to Prediction with Expert Advice, the learning rate must be adaptively tuned. The natural choice of complexity/current loss renders the analys...
149
click to vote
DOLAP
2004
ACM
15 years 12 months ago
2004
ACM
Nowadays, decision support systems are evolving in order to handle complex data. Some recent works have shown the interest of combining on-line analysis processing (OLAP) and data...
154
click to vote
ICDCS
2010
IEEE
15 years 10 months ago
2010
IEEE
—Quantifying and querying network reachability is important for security monitoring and auditing as well as many aspects of network management such as troubleshooting, maintenanc...