Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
The Accommodating Function - A Generalization of the Competitive Ratio
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
A New Competitive Analysis of Randomized Caching
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Average-Case Competitive Analyses for Ski-Rental Problems
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Energy-aware routing in sensor networks: A large system approach
Ad Hoc Networks
Probabilistic analysis for scheduling with conflicts
Theoretical Computer Science
Relative competitive analysis of cache replacement policies
Proceedings of the 2008 ACM SIGPLAN-SIGBED conference on Languages, compilers, and tools for embedded systems
Randomized Competitive Analysis for Two-Server Problems
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
The relative worst order ratio for on-line algorithms
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
ESA'07 Proceedings of the 15th annual European conference on Algorithms
How much information about the future is needed?
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
A randomized algorithm for two servers in cross polytope spaces
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
Average-case competitive analyses for one-way trading
Journal of Combinatorial Optimization
A randomized algorithm for two servers in cross polytope spaces
Theoretical Computer Science
Online Optimization with Uncertain Information
ACM Transactions on Algorithms (TALG)
ONLINEMIN: a fast strongly competitive randomized paging algorithm
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
Query execution timing: taming real-time anytime queries on multicore processors
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Improved space bounds for strongly competitive randomized paging algorithms
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Hi-index | 0.00 |
This paper considers the problems of admission control and virtual circuit routing in high performance computing and communication systems. Admission control and virtual circuit routing problems arise in numerous applications, including video-servers, ...