Thuật toán hàm công việc giải bài toán K-server

Authors: Lã, Ngọc Hải

The k-server problem is a problem of theoretical computer science in the category of online algorithms, one of two abstract problems on metric spaces that are central to the theory of competitive analysis (the other being metrical task systems). In this problem, an online algorithm must control the movement of a set of k servers, represented as points in a metric space, and handle requests that are also in the form of points in the space. As each request arrives, the algorithm must determine which server to move to the requested point. The goal of the algorithm is to keep the total distance all servers move small, relative to the total distance the servers could have moved by an optimal adversary who knows in advance the entire sequence of requests…

Title: Thuật toán hàm công việc giải bài toán K-server
Authors: Lã, Ngọc Hải
Keywords: Toán tin
Thuật toán hàm công việc
Issue Date: 2016
Publisher: H. : ĐHKHTN
Description: 48 tr.
URI: http://repository.vnu.edu.vn/handle/VNU_123/33336
Appears in Collections: Luận văn – Luận án (LIC)

 

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s