Filters








15,275 Hits in 6.0 sec

Randomized algorithm for the k-server problem on decomposable spaces [article]

Judit Nagy-György
2007 arXiv   pre-print
We study the randomized k-server problem on metric spaces consisting of widely separated subspaces.  ...  This method yields o(k)-competitive algorithms solving the randomized k-server problem, for some special underlying metric spaces, e.g. HSTs of "small" height (but unbounded degree).  ...  Ø Ø Ö Ü ×Ø× Ö Ò ÓÑ Þ Ð ÓÖ Ø Ñ Û Ø ÓÑÔ Ø ¹ Ø Ú Ö Ø Ó Θ(log k) Ò ÒÝ Ñ ØÖ ×Ô º Ì ×Ø ÒÓÛÒ ÐÓÛ Ö ÓÙÒ × Ω(log k/ log 2 log k) ¿℄º Ò ØÙÖ Ð ÙÔÔ Ö ÓÙÒ × Ø ÓÙÒ 2k + 1 Ú Ò ÓÖ Ø Ø ÖÑ Ò ×Ø × º Ý Ö ¹ ×ØÖ Ø Ò ÓÙÖ ØØ  ... 
arXiv:0708.2351v1 fatcat:dbrtrzsfffhvxh5qzlirzwvtoq

Randomized algorithm for the k-server problem on decomposable spaces

Judit Nagy-György
2009 Journal of Discrete Algorithms  
We study the randomized k-server problem on metric spaces consisting of widely separated subspaces.  ...  This method yields o(k)-competitive algorithms solving the randomized k-server problem for some special underlying metric spaces, e.g. HSTs of "small" height (but unbounded degree).  ...  Observe that if A is (f, µ)-efficient on N , then A is f (k)-competitive for the k-server problem on N for any 0 < k < µ.  ... 
doi:10.1016/j.jda.2009.02.005 fatcat:d3267f4pcnd4le5rgtlt54cjlu

Randomized k-server algorithms for growth-rate bounded graphs

Yair Bartal, Manor Mendel
2005 Journal of Algorithms  
The paper referred to in the title is withdrawn.  ...  An Algorithm for Decomposable Spaces We recall some concepts from the servers problem on uniform spaces (also known as the paging problem).  ...  If M is α-probabilistically approximated by S and for each S ∈ S there is r-competitive randomized k-server algorithm, then M has αr competitive randomized algorithm for the k-server problem.  ... 
doi:10.1016/j.jalgor.2004.06.002 fatcat:lutklkxed5dcdc7og6r6umpohu

A General Decomposition Theorem for the k-Server Problem

Steven S. Seiden
2002 Information and Computation  
The first general decomposition theorem for the k-server problem is presented.  ...  The only other cases for which polylogarithmic competitive randomized algorithms are known are the uniform metric space, and the weighted cache metric space with two weights.  ...  A k-Server Algorithm for Decomposable Spaces We now develop an algorithm for any metric space that is θ-decomposable.  ... 
doi:10.1006/inco.2002.3144 fatcat:zidg5lo5mvb2hony424mevhyia

A General Decomposition Theorem for the k-Server Problem [chapter]

Steven S. Seiden
2001 Lecture Notes in Computer Science  
The first general decomposition theorem for the k-server problem is presented.  ...  This theorem implies O(polylog(k))-competitive algorithms for certain metric spaces consisting of a polylogarithmic number of widely separated sub-spaces.  ...  A k-Server Algorithm for Decomposable Spaces We now develop an algorithm for any metric space that is θ-decomposable.  ... 
doi:10.1007/3-540-44676-1_7 fatcat:6kkuvndsgnak3e6ccrtmfvmxlq

R–LINE: A better randomized 2-server algorithm on the line

Lucas Bang, Wolfgang Bein, Lawrence L. Larmore
2015 Theoretical Computer Science  
A randomized on-line algorithm is given for the 2-server problem on the line, with competitiveness less than 1.901 against the oblivious adversary.  ...  This improves the previously best known competitiveness of 155 78 ≈ 1.987 for the problem. The algorithm uses a new approach and defines a potential in terms of isolation indices from T-theory.  ...  Acknowledgement Part of the work of author Wolfgang Bein was supported by National Science Foundation grant IIA 1427584.  ... 
doi:10.1016/j.tcs.2015.08.043 fatcat:uyn2nh2id5cevdin5sqlugrpou

R–LINE: A Better Randomized 2-Server Algorithm on the Line [chapter]

Lucas Bang, Wolfgang Bein, Lawrence L. Larmore
2013 Lecture Notes in Computer Science  
A randomized on-line algorithm is given for the 2-server problem on the line, with competitiveness less than 1.901 against the oblivious adversary.  ...  This improves the previously best known competitiveness of 155 78 ≈ 1.987 for the problem. The algorithm uses a new approach and defines a potential in terms of isolation indices from T-theory.  ...  Acknowledgement Part of the work of author Wolfgang Bein was supported by National Science Foundation grant IIA 1427584.  ... 
doi:10.1007/978-3-642-38016-7_11 fatcat:mllli7t52fdrrnjwk3xfxady4i

Page 1283 of Mathematical Reviews Vol. , Issue 2001B [page]

2001 Mathematical Reviews  
algorithm for two servers on the line.  ...  This implies that one unbiased random bit is not sufficient to improve the ratio of 2 for the two-server problem.  ... 

On the Cryptographic Complexity of the Worst Functions [chapter]

Amos Beimel, Yuval Ishai, Ranjit Kumaresan, Eyal Kushilevitz
2014 Lecture Notes in Computer Science  
The worst-case complexity of the best previous solutions was Ω(N ) for the first three problems and Ω(N/ log N ) for the last one.  ...  For every graph G on N nodes, there is a secret-sharing scheme for N parties in which each pair of parties can reconstruct the secret if and only if the corresponding nodes in G are connected, and where  ...  A k-server decomposable PIR protocol P = (Q, A, R) for F N,k−1 consists of three algorithms: a randomized query algorithm Q, an answering algorithm A, and a reconstruction algorithm R.  ... 
doi:10.1007/978-3-642-54242-8_14 fatcat:q3ccfhvn5jea5fnlvvqoydjhau

A Novel Algorithm of Quantum Random Walk in Server Traffic Control and Task Scheduling

Dong Yumin, Xiao Shufen
2014 Journal of Applied Mathematics  
For the data clustering problem of high dimensional space, we can decompose onem-dimensional quantum random walk intomone-dimensional quantum random walk.  ...  We introduce the method of random walk and illuminate what the quantum random walk is. Here, we mainly research the standard model of one-dimensional quantum random walk.  ...  Acknowledgment This work is supported by the National Natural Science Foundation of China (61173056).  ... 
doi:10.1155/2014/818479 fatcat:jzgz62izkfbftgi3powk3a34tu

Intelligent resource allocation in mobile blockchain for privacy and security transactions: a deep reinforcement learning based approach

Zhaolong Ning, Shouming Sun, Xiaojie Wang, Lei Guo, Guoyin Wang, Xinbo Gao, Ricky Y. K. Kwok
2021 Science China Information Sciences  
We decompose the formulated problem into two subproblems to decrease the dimension of action space.  ...  Then, we propose a deep reinforcement learning additional particle swarm optimization (DRPO) algorithm to solve the two subproblems, in which a particle swarm optimization algorithm is leveraged to avoid  ...  In DRPO, we decompose the formulated problem into two subproblems to reduce the dimension of the action space, and PSO scheme is integrated to avoid the unnecessary random search for actions in DDPG.  ... 
doi:10.1007/s11432-020-3125-y fatcat:djs7vowuzrezro6xhk33lfhfle

Competitive Algorithms for Generalized k-Server in Uniform Metrics [article]

Nikhil Bansal, Marek Elias, Grigorios Koumoutsos, Jesper Nederlof
2017 arXiv   pre-print
The generalized k-server problem is a far-reaching extension of the k-server problem with several applications. Here, each server s_i lies in its own metric space M_i.  ...  Despite much work, no f(k)-competitive algorithm is known for the problem for k > 2 servers, even for special cases such as uniform metrics and lines.  ...  Acknowledgments We would like to thank René Sitters for useful discussions on the generalized k-server problem.  ... 
arXiv:1707.04519v2 fatcat:7m3uplulvff33hj5mppbmbaaea

Competitive Algorithms for Generalized k-Server in Uniform Metrics [chapter]

Nikhil Bansa, Marek Eliáš, Grigorios Koumoutsos, Jesper Nederlof
2018 Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms  
The generalized k-server problem is a far-reaching extension of the k-server problem with several applications. Here, each server s i lies in its own metric space M i .  ...  Despite much work, no f (k)-competitive algorithm is known for the problem for k > 2 servers, even for special cases such as uniform metrics and lines.  ...  Acknowledgments We would like to thank René Sitters for useful discussions on the generalized k-server problem.  ... 
doi:10.1137/1.9781611975031.64 dblp:conf/soda/Bansal0KN18 fatcat:xohqzeopincunoilmeyv3ogoia

Distance Computation Between Binary Code and Real Vector for Efficient Keypoint Matching

Yuji Yamauchi, Mitsuru Ambai, Ikuro Sato, Yuichi Yoshida, Hironobu Fujiyoshi
2013 IPSJ Transactions on Computer Vision and Applications  
For second problem, we compute efficiently the Euclidean distance by decomposing the real vector into weight factors and binary basis vectors.  ...  Image recognition in client server system has a problem of data traffic. However, reducing data traffic gives rise to worsening of performance.  ...  [8] proposed decomposing the real vector y α into k weight factors and k binary basis vectors as y α ≈ Mc, (3) where c = (c 1 , c 2 , · · · , c k ) T ∈ R k is the weight factor and M = {m 1 , m 2 ,  ... 
doi:10.2197/ipsjtcva.5.124 fatcat:773yp3youbby7kajiwn6sgqk2a

Randomized Algorithms for Dynamic Storage Load-Balancing

Liang Liu, Lance Fortnow, Jin Li, Yating Wang, Jun Xu
2016 Proceedings of the Seventh ACM Symposium on Cloud Computing - SoCC '16  
We propose a randomized algorithm, in which each dispatcher independently samples a blocks-to-disks assignment according to a probability distribution on a set of assignments conforming to the aforementioned  ...  In this work, we study a challenging research problem that arises in minimizing the cost of storing customer data online for reliable access in a cloud.  ...  Acknowledgments We thank anonymous reviewers for their insightful comments and suggestions that help improve the quality of the paper. We also thank Mr. Jian Huang and Prof.  ... 
doi:10.1145/2987550.2987572 dblp:conf/cloud/LiuFLWX16 fatcat:nrevsox3bfaplpw44fj5c4cwra
« Previous Showing results 1 — 15 out of 15,275 results