Abstract

Competitive analysis of algorithms.- Self-organizing data structures.- Competitive analysis of paging.- Metrical task systems, the server problem and the work function algorithm.- Distributed paging.- Competitive analysis of distributed algorithms.- On-line packing and covering problems.- On-line load balancing.- On-line scheduling.- On-line searching and navigation.- On-line network routing.- On-line network optimization problems.- Coloring graphs on-line.- On-Line Algorithms in Machine Learning.- Competitive solutions for on-line financial problems.- On the performance of competitive algorithms in practice.- Competitive odds and ends.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.