Filters








36,503 Hits in 5.8 sec

Online Algorithms for Self-Organizing Sequential Search - A Survey [article]

Rakesh Mohanty, N. S. Narayanaswamy
2009 arXiv   pre-print
The survey includes competitiveness results of deterministic and randomized online algorithms and complexity results of optimal off line algorithms for the list update problem.  ...  The main objective of this survey is to present the important theoretical and experimental results contributed till date in the area of online algorithms for the self organizing sequential search problem  ...  proved a lower bound of 1.5 on the competitive ratio of any randomized online algorithm in 1993.  ... 
arXiv:0909.0095v2 fatcat:k4zxtd54tzg3riby7mgtjbtuvq

On Developing New Models, with Paging as a Case Study

Reza Dorrigiv, Alejandro López-Ortiz
2010 ACM SIGACT News  
in developing models and measures that better reflect actual practice for the case of paging.  ...  In this paper we discuss first certain shortcomings of the online competitive analysis model particularly as it concerns paging, discuss existing solutions in the literature as well as present recent progress  ...  In this section we study the reasons behind the gap between theory and practice for online algorithm analysis .  ... 
doi:10.1145/1711475.1714372 fatcat:hg65vtitcjfuvokc2db2gtgefu

An Application of Self-organizing Data Structures to Compression [chapter]

Reza Dorrigiv, Alejandro López-Ortiz, J. Ian Munro
2009 Lecture Notes in Computer Science  
Our experiments show MTF outperforms other list update algorithms in practice after BWT.  ...  In this paper we perform an experimental comparison of various list update algorithms both as stand alone compression mechanisms and as a second stage of the BWT-based compression.  ...  Competitiveness of List Update Algorithms for Compression A list update algorithm A incurs cost i to access the ith item of the list.  ... 
doi:10.1007/978-3-642-02011-7_14 fatcat:4l67nkiwj5brdc42uw3jbkil4u

Online Computation with Untrusted Advice

Spyros Angelopoulos, Christoph Dürr, Shendan Jin, Shahin Kamali, Marc Renault, Michael Wagner
2020 Innovations in Theoretical Computer Science  
For bin packing and list update, we give online algorithms with worst-case tradeoffs in their competitiveness, depending on whether the advice is trusted or not; this is motivated by work of Lykouris and  ...  Furthermore, we demonstrate how to prove lower bounds, within this model, on the tradeoff between the number of advice bits and the competitiveness of any online algorithm.  ...  In Sections 4 and 5, we study the bin packing and list update problems; these problems are central in the analysis of online problems and competitiveness, and have numerous applications in practice.  ... 
doi:10.4230/lipics.itcs.2020.52 dblp:conf/innovations/0001DJKR20 fatcat:5b3dvma6g5b4flw3boz6m7wjde

Page 6804 of Mathematical Reviews Vol. , Issue 2002I [page]

2002 Mathematical Reviews  
(D-MPI-I; Saarbriicken) On the competitive theory and practice of online list accessing algorithms. (English summary) Algorithmica 32 (2002), no. 2, 201-246.  ...  Summary: “This paper concerns the online list accessing prob- lem. In the first part of the paper we present two new families of list accessing algorithms.  ... 

Parameterized Analysis of Paging and List Update Algorithms

Reza Dorrigiv, Martin R. Ehmsen, Alejandro López-Ortiz
2013 Algorithmica  
We define a measure for locality that is based on Denning's working set model and express the performance of well known algorithms in term of this parameter.  ...  The idea is to rather than normalizing the performance of an online algorithm by an (optimal) offline algorithm, we explicitly express the behavior of the algorithm in terms of two more natural parameters  ...  This resolved an important disparity between theory and practice of online paging algorithms, namely the superiority in practice of LRU.  ... 
doi:10.1007/s00453-013-9800-5 fatcat:v7vlp5al7jdrjihan6dctcc2yu

Parameterized Analysis of Paging and List Update Algorithms [chapter]

Reza Dorrigiv, Martin R. Ehmsen, Alejandro López-Ortiz
2010 Lecture Notes in Computer Science  
We define a measure for locality that is based on Denning's working set model and express the performance of well known algorithms in term of this parameter.  ...  The idea is to rather than normalizing the performance of an online algorithm by an (optimal) offline algorithm, we explicitly express the behavior of the algorithm in terms of two more natural parameters  ...  This resolved an important disparity between theory and practice of online paging algorithms, namely the superiority in practice of LRU.  ... 
doi:10.1007/978-3-642-12450-1_10 fatcat:xggvwcharfd5bloxqanmkbej2q

Page 5098 of Mathematical Reviews Vol. , Issue 2000g [page]

2000 Mathematical Reviews  
Beginning with the basic definitions of competitive analysis, the authors present the main techniques through various examples: the list accessing problem, deterministic and randomized paging, alternative  ...  {For the entire collection see MR 2000f:68002. } 2000g:68053 68Q25 68-01 68-02 68Q10 90B18 Borodin, Allan (3-TRNT; Toronto, ON); El-Yaniy, Ran (IL-TECH; Haifa) * Online computation and competitive analysis  ... 

Page 8880 of Mathematical Reviews Vol. , Issue 2000m [page]

2000 Mathematical Reviews  
Finally, we give a lower bound on the competitive ratio of online algorithms for RLUP.” © 2000 Academic Press 2000m:68059 68P30 94899 94C12 Herman, Ted (1-IA-C; Iowa City, IA); Pemmaraju, Sriram (6-IIT  ...  The issues involved in managing this kind of data are not addressed by tradi- tional database systems, either in theory or in practice.  ... 

Truthful Channel Sharing for Self Coexistence of Overlapping Medical Body Area Networks

Gengfa Fang, Mehmet A. Orgun, Rajan Shankaran, Eryk Dutkiewicz, Guanglou Zheng, Cheng-Yi Xia
2016 PLoS ONE  
In this paper, we address this issue by proposing a truthful online channel sharing algorithm and a companion protocol that allocates channel efficiently and truthfully by punishing MBANs for misreporting  ...  Our extensive simulation results show our scheme can achieve a total profit that is more than 85% of the offline optimum method in the typical MBAN settings.  ...  Other parts of the algorithm, such as the sorting algorithm and for loops, perform operations on the request list.  ... 
doi:10.1371/journal.pone.0148376 pmid:26844888 pmcid:PMC4742247 fatcat:mk5qff2vlng2tj2euxmvgxh4ue

Paging and List Update under Bijective Analysis [chapter]

Spyros Angelopoulos, Pascal Schweitzer
2009 Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms  
This is an intuitive technique which is based on pairwise comparison of the costs incurred by two algorithms on sets of request sequences of the same size.  ...  It has long been known that for the paging problem in its standard form, competitive analysis cannot adequately distinguish algorithms based on their performance: there exists a vast class of algorithms  ...  Acknowledgments We are thankful to Alejandro López-Ortiz and Reza Dorrigiv for earlier discussions on the problem.  ... 
doi:10.1137/1.9781611973068.123 fatcat:zz54y4nsejgbdhnup6s3epb3ia

Paging and list update under bijective analysis

Spyros Angelopoulos, Pascal Schweitzer
2013 Journal of the ACM  
This is an intuitive technique which is based on pairwise comparison of the costs incurred by two algorithms on sets of request sequences of the same size.  ...  It has long been known that for the paging problem in its standard form, competitive analysis cannot adequately distinguish algorithms based on their performance: there exists a vast class of algorithms  ...  Acknowledgments We are thankful to Alejandro López-Ortiz and Reza Dorrigiv for earlier discussions on the problem.  ... 
doi:10.1145/2450142.2450143 fatcat:br2lgkc3vzevvbdotnfg2mulrm

Page 8751 of Mathematical Reviews Vol. , Issue 99m [page]

1999 Mathematical Reviews  
Karlin, On the performance of 68 COMPUTER SCIENCE 99m:68004 competitive algorithms in practice (373-384); Amos Fiat and Ger- hard J.  ...  The book concludes with an afterword by the editors on various aspects of competitive analysis, and an appendix of over 800 references on on-line algorithms. Peter B.  ... 

A Smart Access Control Method for Online Social Networks Based on Support Vector Machine

Fangfang Shan, Jizhao Liu, Xueyuan Wang, Weiguang Liu, Bing Zhou
2020 IEEE Access  
Aiming at above problems, a smart access control method for online social networks is proposed based on SVM algorithm to realize smart access control on the basis of integrating relationship types and  ...  With the rapid development of Internet technology, online social networks (OSNs) has become one of the main ways for people to develop social activities.  ...  ACKNOWLEDGMENT The authors would like to thank the editor and the anonymous referees for their constructive comments.  ... 
doi:10.1109/access.2020.2963932 fatcat:nvrs5dlyajarji4v63yk4acsjq

Online Adversarial Attacks [article]

Andjela Mladenovic, Avishek Joey Bose, Hugo Berard, William L. Hamilton, Simon Lacoste-Julien, Pascal Vincent, Gauthier Gidel
2022 arXiv   pre-print
yet practical online algorithm.  ...  Finally, we complement our theoretical results by conducting experiments on MNIST, CIFAR-10, and Imagenet classifiers, revealing the necessity of online algorithms in achieving near-optimal performance  ...  Avishek Joey Bose conceived the idea of online attacks, drove the writing of the paper and helped Andjela Mladenovic with experimental results on synthetic data.  ... 
arXiv:2103.02014v4 fatcat:c3uxtjbkfbbrhoio372o7s4hli
« Previous Showing results 1 — 15 out of 36,503 results