Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > Combinatorial Optimization and Applications: 5th International Conference, COCOA 2011, Zhangjiajie, China, August 4-6, 2011, Proceedings > A Comprehensive Study of an Online Packet Scheduling Algorithm
Combinatorial Optimization and Applications: 5th International Conference, COCOA 2011, Zhangjiajie, China, August 4-6, 2011, Proceedings |
Weifan Wang; Xuding Zhu; Ding-Zhu Du
Springer Berlin Heidelberg
Combinatorial Optimization and Applications: 5th International Conference, COCOA 2011, Zhangjiajie, China, August 4-6, 2011, Proceedings
A Comprehensive Study of an Online Packet Scheduling Algorithm
Authors

Fei Li

ARI Id

1664823281038_3664325

Access

Not Available Free

Pages

52-63

DOI

10.1007/978-3-642-22616-8_5

Chapter URL

https://rd.springer.com/chapter/10.1007/978-3-642-22616-8_5

Table of Contents of Book
Showing 1 to 20 of 45 entries
Chapters/HeadingsAuthor(s)PagesInfo
Front Matter
The Complexity of Testing Monomials in Multivariate Polynomials
Zhixiang Chen; Bin Fu
1-15
Algorithms for Testing Monomials in Multivariate Polynomials
Zhixiang Chen; Bin Fu; Yang Liu; Robert Schweller
16-30
Hybrid Artificial Bee Colony Search Algorithm Based on Disruptive Selection for Examination Timetabling Problems
Malek Alzaqebah; Salwani Abdullah
31-45
Heuristics for Parallel Machine Scheduling with Deterioration Effect
Ming Liu; Feifeng Zheng; Yinfeng Xu; Lu Wang
46-51
A Comprehensive Study of an Online Packet Scheduling Algorithm
Fei Li
52-63
Optimal Policy for Single-Machine Scheduling with Deterioration Effects, Learning Effects, Setup Times, and Availability Constraints
Sheng Yu; Yinfeng Xu; Ming Liu; Feifeng Zheng
64-73
Algebraic Algorithm for Scheduling Data Retrieval in Multi-channel Wireless Data Broadcast Environments
Xiaofeng Gao; Zaixin Lu; Weili Wu; Bin Fu
74-81
Hamiltonian Cycles through Prescribed Edges in k-Ary n-Cubes
Iain A. Stewart
82-97
A Fast Parallel Algorithm for Finding a Most Reliable Source on a General Ring-Tree Graph with Unreliable Edges
Wei Ding; Guoliang Xue
98-112
Restricted Edge Connectivity of Harary Graphs
Qinghai Liu; Xiaohui Huang; Zhao Zhang
113-125
Efficient Algorithms for Finding the k Most Vital Edges for the Minimum Spanning Tree Problem
Cristina Bazgan; Sonia Toubaline; Daniel Vanderpooten
126-140
Euclidean Chains and Their Shortcuts
Boting Yang
141-155
List Dynamic Coloring of Sparse Graphs
Seog-Jin Kim; Won-Jin Park
156-162
Further Improvement on Maximum Independent Set in Degree-4 Graphs
Mingyu Xiao; Hiroshi Nagamochi
163-178
Approximation Algorithms for Minimum Energy Multicast Routing with Reception Cost in Wireless Sensor Networks
Deying Li; Zewen Liu; Yi Hong; Wenping Chen
179-191
Public Communication Based on Russian Cards Protocol: A Case Study
Jia He; Zhenhua Duan
192-206
Minimum Latency Data Aggregation in Wireless Sensor Network with Directional Antenna
Hui Liu; Zewen Liu; Hongwei Du; Deying Li; Xianling Lu
207-221
A Near-Optimal Memoryless Online Algorithm for FIFO Buffering Two Packet Classes
Fei Li
222-233
On the Maximum Locally Clustered Subgraph and Some Related Problems
Bang Ye Wu
234-246
Chapters/HeadingsAuthor(s)PagesInfo
Showing 1 to 20 of 45 entries
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings