"A Near-Optimal Memoryless Online Algorithm for FIFO Buffering Two Packet Classes"

entries per page

Filter:

Showing 1 to 20 of 100 entries

Book	Author(s)	Year	Publisher
An optimal parallel algorithm for selection.	U. Vishkin	1983	Courant Institute of Mathematical Sciences, New York University
An optimal parallel algorithm for selection	U. Vishkin	1983	Courant Institute of Mathematical Sciences, New York University
A branch-and-bound algorithm for optimal NOR networks (the algorithm description)	Tomoyasu Nakagawa	1971	Dept. of Computer Science, University of Illinois
An optimal selection algorithm.	Richard Cole	1986	Courant Institute of Mathematical Sciences, New York University
An optimal selection algorithm	Richard Cole	1986	Courant Institute of Mathematical Sciences, New York University
A time slot assignment algorithm for a TDMA packet radio network	William Karl Tritchler	1983	Naval Postgraduate School
An iteration algorithm for optimal network flows	Chang Joon Woong	1983	Naval Postgraduate School
A branch-and-bound algorithm for optimal AND-OR networks (the algorithm description)	Tomoyasu Nakagawa	1971	Dept. of Computer Science, University of Illinois
A MATLAB GUI for a Legendre Pseudospectral algorithm for optimal control problems	Andrew O. Hall	1999	Naval Postgraduate School;Available from National Technical Information Service
Automated pole placement algorithm for multivariable optimal control synthesis	Wah Keh Chow	1985
On optimal parallel algorithm for building a data structure for planar point location	Richard Cole	1987	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
An optimal scheduling algorithm with a competitive factor for real-time systems.	Gilad Koren	1991	Courant Institute of Mathematical Sciences, New York University
optimal on-line scheduling algorithm for overloaded real-time systems.	Gilad Koren	1992	Courant Institute of Mathematical Sciences, New York University
Application of a distributed routing algorithm to a packet-switched communications network	Robert Reade Logan	1983	Naval Postgraduate School
Online Algorithms for Optimal Energy Distribution in Microgrids	Yu Wang; Shiwen Mao; R. Mark Nelms	2015	Springer International Publishing
Heuristic algorithms for constructing near-optimal decision trees	Joan Manning Alster	1971
An algorithm for noisy function minimization for use in determining optimal trajectories	I. Bert Russak	1987	Naval Postgraduate School
Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions	Michael Jünger; Denis Naddef	2001	Springer Berlin Heidelberg
An optimal on-line scheduling algorithm for overloaded real-time systems	Gilad Koren	1992	Courant Institute of Mathematical Sciences, New York University
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
A Near-Optimal Memoryless Online Algorithm for FIFO Buffering Two Packet Classes	Fei Li	Combinatorial Optimization and Applications: 5th International Conference, COCOA 2011, Zhangjiajie, China, August 4-6, 2011, Proceedings	Weifan Wang; Xuding Zhu; Ding-Zhu Du	2011	Springer Berlin Heidelberg
Geometric Aspects of Online Packet Buffering: An Optimal Randomized Algorithm for Two Buffers	Marcin Bienkowski; Aleksander Mądry	LATIN 2008: Theoretical Informatics: 8th Latin American Symposium, Búzios, Brazil, April 7-11, 2008, Proceedings	Eduardo Sany Laber; Claudson Bornstein; Loana Tito Nogueira; Luerbio Faria	2008	Springer Berlin Heidelberg
A Near Optimal Algorithm for Vertex Connectivity Augmentation	Bill Jackson; Tibor Jordán	Algorithms and Computation: 11th International Conference, ISAAC 2000, Taipei, Taiwan, December 18-20, 2000. Proceedings	D.T. Lee; Shang-Hua Teng	2000	Springer Berlin Heidelberg
An Optimal Algorithm for Online Square Detection	Gen-Huey Chen; Jin-Ju Hong; Hsueh-I Lu	Combinatorial Pattern Matching: 16th Annual Symposium, CPM 2005, Jeju Island, Korea, June 19-22, 2005, Proceedings	Alberto Apostolico; Maxime Crochemore; Kunsoo Park	2005	Springer Berlin Heidelberg
An Optimal Algorithm for Online Square Detecti		Combinatorial Pattern Matching: 16th Annual Symposium, CPM 2005, Jeju Island, Korea, June 19-22, 2005. Proceedings	Broňa Brejová, Daniel G. Brown, Ian M. Harrower (auth.), Alberto Apostolico, Maxime Crochemore, Kunsoo Park (eds.)	2005	Springer-Verlag Berlin Heidelberg
22 The Optimal Online Algorithm		STACS 2009: Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, Freiburg, Germany, 26-28 February 2009 (Leibniz International Proceedings in Informatics - LIPIcs)	Susanne Albers, Jean-Yves Marion (eds.)		Schloss Dagstuhl - Leibniz-Zentrum fu r Informatik
172 Buffering Algorithm		x86-64 Assembly Language Programming with Ubuntu	Ed Jorgensen	2020
An optimal deterministic algorithm for online b-matching	Bala Kalyanasundaram; Kirk Pruhs	Foundations of Software Technology and Theoretical Computer Science: 16th Conference, Hyderabad, India, December 18 - 20, 1996, Proceedings	Vijay Chandru; V. Vinay	1996	Springer Berlin Heidelberg
An optimal parallel algorithm for computing a near-optimal order of matrix multiplications	Artur Czumaj	Algorithm Theory - SWAT ' 92: Third Scandinavian Workshop on Algorithm Theory, Helsinki, Finland, July 8-10, 1992. Proceedings	Otto Nurmi; Esko Ukkonen	1992	Springer Berlin Heidelberg
A Comprehensive Study of an Online Packet Scheduling Algorithm	Fei Li	Combinatorial Optimization and Applications: 5th International Conference, COCOA 2011, Zhangjiajie, China, August 4-6, 2011, Proceedings	Weifan Wang; Xuding Zhu; Ding-Zhu Du	2011	Springer Berlin Heidelberg
OPTIMAL PACKET LENGTH		Delivering Voice over IP Networks, 2nd Edition	Daniel Minoli, Emma Minoli	2002	Wiley
Near-Optimal Online Algorithms for Prize-Collecting Steiner Problems	MohammadTaghi Hajiaghayi; Vahid Liaghat; Debmalya Panigrahi	Automata, Languages, and Programming: 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I	Javier Esparza; Pierre Fraigniaud; Thore Husfeldt; Elias Koutsoupias	2014	Springer Berlin Heidelberg
Near Optimal Algorithms for Online Maximum Weighted b-Matching	Hingfung Ting; Xiangzhong Xiang	Frontiers in Algorithmics: 8th International Workshop, FAW 2014, Zhangjiajie, China, June 28-30, 2014, Proceedings	Jianer Chen; John E. Hopcroft; Jianxin Wang	2014	Springer International Publishing
Online Packet Switching	Yossi Azar	Approximation and Online Algorithms: Second International Workshop, WAOA 2004, Bergen, Norway, September 14-16, 2004, Revised Selected Papers	Giuseppe Persiano; Roberto Solis-Oba	2005	Springer Berlin Heidelberg
A Memory Efficient Algorithm for Packet Classification	Zhen Xu; Jun Sun; Jun Zhang	Wireless Algorithms, Systems, and Applications: First International Conference, WASA 2006, Xi' an, China, August 15-17, 2006, Proceedings	Xiuzhen Cheng; Wei Li; Taieb Znati	2006	Springer Berlin Heidelberg
114 Two Classes of Optimal Strategy		Integrating Ethics With Strategy: Selected Papers of Alan E. Singer	Alan E. Singer	2007	World Scientific Publishing Company
221 Log-Optimal Portfolio for Memoryless Market Process		Machine learning for financial engineering	Györfi, László; Ottucsak, Gyorgy; Walk, Harro	2012	Imperial College Press
Implementation of a Near-Optimal Complex Root Clustering Algorithm	Rémi Imbach; Victor Y. Pan; Chee Yap	Mathematical Software – ICMS 2018: 6th International Conference, South Bend, IN, USA, July 24-27, 2018, Proceedings	James H. Davenport; Manuel Kauers; George Labahn; Josef Urban	1st ed. 2018	Springer International Publishing
An Experimental Study of New and Known Online Packet Buffering Algorithms	Susanne Albers; Tobias Jacobs	Algorithms - ESA 2007: 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings	Lars Arge; Michael Hoffmann; Emo Welzl	2007	Springer Berlin Heidelberg
TCP Throughput Guarantee Using Packet Buffering	Sunwoong Choi; Chongkwon Kim	Networking - ICN 2001: First International Conference on Networking, Colmar, France July 9-13, 2001 Proceedings, Part II	Pascal Lorenz	2001	Springer Berlin Heidelberg
Chapter	Author(s)	Book	Book Authors	Year	Publisher

Showing 1 to 20 of 100 entries

"A Near-Optimal Memoryless Online Algorithm for FIFO Buffering Two Packet Classes" - similar Books and Chapters