"OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm"

entries per page

Filter:

Showing 1 to 20 of 100 entries

Book	Author(s)	Year	Publisher
Paging Aphrodite	Kim Green	2004	Bantam Dell
Paging the Dead	Brynn Bonner	2013	Gallery Books
Paging Dr. Daddy	Teresa Southwick	2008	Silhouette Books
A fast and simple algorithm for the maximum flow problem	Ravindra K. Ahuja	1987	Sloan School of Management, Massachusetts Institute of Technology
A fast and simple algorithm for the maximum flow problem	Ravindra K. Ahuja	1988	Sloan School of Management, Massachusetts Institute of Technology
Paging Mr. Shakespeare: a critical challenge.	Walter Hart Blumenthal	1961	University Publishers
An optimal scheduling algorithm with a competitive factor for real-time systems	Gilad Koren	1991	Courant Institute of Mathematical Sciences, New York University
An optimal scheduling algorithm with a competitive factor for real-time systems.	Gilad Koren	1991	Courant Institute of Mathematical Sciences, New York University
Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems	Masaru Tomita	1986	Springer US
Randomized Algorithms	Rajeev Motwani; Prabhakar Raghavan	1995-08	Cambridge University Press
Adaptive memory management in a paging environment	Gary Michael Raetz	1973	Naval Postgraduate School
Strongly tempted	G. Curtis Jones	1968	World Pub. Co
On fast algorithm and VLSI design of finite computational structures	Rom-Shen Kao	1991
Cepstral filtering on a columnar image architecture: a fast algorithm for binocular stereo segmentation.	Yehezkel Yeshurun	1987	Courant Institute of Mathematical Sciences, New York University
Running Randomized Evaluations	Glennerster, Rachel; Takavarasha, Kudzai	0
Running Randomized Evaluations	Rachel Glennerster	2013	Princeton University Press
Randomized signal processing	Ivars Bil̦inskis	1992	Prentice Hall
Running Randomized Evaluations: A Practical Guide	Rachel Glennerster; Kudzai Takavarasha	2014	Princeton University Press
Strongly Regular Graphs	Andries E. Brouwer; H. Van Maldeghem	2022-01	Cambridge University Press
Strongly Coupled Plasmas	Gabor Kalman	1978	Springer Science & Business Media
Boook	Author(s)	Year	Publisher

Showing 1 to 20 of 100 entries

entries per page

Filter:

Showing 1 to 20 of 100 entries

Chapter	Author(s)	Book	Book Authors	Year	Publisher
OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm	Gerth Stølting Brodal; Gabriel Moruz; Andrei Negoescu	Approximation and Online Algorithms: 9th International Workshop, WAOA 2011, Saarbrücken, Germany, September 8-9, 2011, Revised Selected Papers	Roberto Solis-Oba; Giuseppe Persiano	2012	Springer Berlin Heidelberg
Improved Space Bounds for Strongly Competitive Randomized Paging Algorithms	Gabriel Moruz; Andrei Negoescu	Automata, Languages, and Programming: 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part I	Fedor V. Fomin; Rusins Freivalds; Marta Kwiatkowska; David Peleg	2013	Springer Berlin Heidelberg
Competitive analysis of randomized paging algorithms	Dimitris Achlioptas; Marek Chrobak; John Noga	Algorithms - ESA ' 96: Fourth Annual European Symposium, Barcelona, Spain, September 25-27, 1996. Proceedings	Joseph Diaz; Maria Serna	1996	Springer Berlin Heidelberg
Competitive Analysis of the LRFU Paging Algorithm	Edith Cohen; Haim Kaplan; Uri Zwick	Algorithms and Data Structures: 7th International Workshop, WADS 2001 Providence, RI, USA, August 8-10, 2001 Proceedings	Frank Dehne; Jörg-Rüdiger Sack; Roberto Tamassia	2001	Springer Berlin Heidelberg
A fast randomized LOGSPACE algorithm for graph connectivity	Uriel Feige	Automata, Languages, and Programming: 21st International Colloquium, ICALP ' 94, Jerusalem, Israel, July 11-14, 1994. Proceedings	Serge Abiteboul; Eli Shamir	1994	Springer Berlin Heidelberg
Randomized Algorithm		Encyclopedia of Operations Research and Management Science	Saul I. Gass; Michael C. Fu	3rd ed. 2013	Springer US
Randomized Algorithm		Algorithms Practical Guide to Learn Algorithms for Beginners	Andy Vickler	2021
Competitive analysis of paging	Sandy Irani	Online Algorithms: The State of the Art	Amos Fiat; Gerhard J. Woeginger	1998	Springer Berlin Heidelberg
Randomized online multi-threaded paging	Steven S. Seiden	Algorithm Theory - SWAT' 98: 6th Scandinavian Workshop on Algorithm Theory, Stockholm, Sweden, July 8-10, 1998, Proceedings	Stefan Arnborg; Lars Ivansson	1998	Springer Berlin Heidelberg
A Provably-Secure Strongly-Randomized Cipher	Ueli M. Maurer	Advances in Cryptology – EUROCRYPT ' 90: Workshop on the Theory and Application of Cryptographic Techniques, Aarhus, Denmark, May 21-24, 1990. Proceedings	Ivan B. Damgard	1991	Springer Berlin Heidelberg
A Randomized Unpredictable Algorithm		Tree structures in broadcast encryption	Kristin Anderson.	2005	Linköpings universitet
A Competitive Online Algorithm for the Paging Problem with “Shelf” Memory	Sung-Pil Hong	Computing and Combinatorics: 5th Annual International Conference, COCOON' 99, Tokyo, Japan, July 26-28, 1999, Proceedings	Takao Asano; Hiroshi Imai; D.T. Lee; Shin-ichi Nakano; Takeshi Tokuyama	1999	Springer Berlin Heidelberg
A Randomized Competitive Algorithm for Evaluating Priced AND/OR Trees	Eduardo Sany Laber	STACS 2004: 21st Annual Symposium on Theoretical Aspects of Computer Science, Montpellier, France, March 25-27, 2004, Proceedings	Volker Diekert; Michel Habib	2004	Springer Berlin Heidelberg
A Randomized Competitive Algorithm for Evaluating Priced AND/OR Tre		STACS 2004: 21st Annual Symposium on Theoretical Aspects of Computer Science, Montpellier, France, March 25-27, 2004. Proceedings	Claire Kenyon (auth.), Volker Diekert, Michel Habib (eds.)	2004	Springer-Verlag Berlin Heidelberg
Fast Group Paging Algorithm for Large-Scale MTC Systems	Si Huang; Xiaohui Li; Bin Zhou; Yanbin Zhao; Ruiyang Yuan	Communications and Networking: 12th International Conference, ChinaCom 2017, Xi’an, China, October 10-12, 2017, Proceedings, Part II	Bo Li; Lei Shu; Deze Zeng	1st ed. 2018	Springer International Publishing
1063 Randomized algorithm		Foundations of Machine Learning	Mehryar Mohri, Afshin Rostamizadeh, Ameet Talwalkar	2018	MIT Press
19 Randomized Algorithm		Computer Science, Algorithms and Complexity	Adele Kuzmiakova	2020	Arcler Press
1063 Randomized algorithm		Foundations of Machine Learning	Mohri Mehryar, Afshin Rostamizadeh, and Ameet Talwalkar	2018	The MIT Press
Buying a Constant Competitive Ratio for Paging	János Csirik; Csanád Imreh; John Noga; Steve S. Seiden; Gerhard J. Woeginger	Algorithms - ESA 2001: 9th Annual European Symposium, Aarhus, Denmark, August 28-31, 2001, Proceedings	Friedhelm Meyer auf der Heide	2001	Springer Berlin Heidelberg
A randomized probability matching algorithm		Test-driven machine learning: control your machine learning algorithms using test-driven development to achieve quantifiable milestones	Bozonier, Justin	2015	Packt Publishing
Chapter	Author(s)	Book	Book Authors	Year	Publisher

Showing 1 to 20 of 100 entries

"OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm" - similar Books and Chapters