๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An efficient algorithm for scheduling in bluetooth piconets and scatternets

โœ Scribed by G. Ramana Reddy; Shalabh Bhatnagar; V. Rakesh; Vijay Prakash Chaturvedi

Publisher
Springer
Year
2009
Tongue
English
Weight
824 KB
Volume
16
Category
Article
ISSN
1022-0038

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An efficient branch-and-bound algorithm
An efficient branch-and-bound algorithm for the two-machine bicriteria flowshop scheduling problem
โœ Wei-Chang Yeh ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Society of Manufacturing Engineers ๐ŸŒ English โš– 826 KB

In this study, the two-machine bicriteria flowshop scheduling problem is addressed. The objective is to minimize a weighted sum of total flowtime and makespan. Different branch-and-bound algorithms have already appeared in the literature for this problem. In this study, a more efficient branch-and-b

An efficient scheduling algorithm for di
An efficient scheduling algorithm for distributed real-time systems with end-to-end timing constraints
โœ Atsushi Togawa; Eiji Okubo ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 195 KB

This paper proposes an efficient scheduling algorithm for distributed real-time systems with such timing constraints as jitter and end-to-end timing. Conventionally, backtrack searching and annealing methods have been used for scheduling problems when timing constraints are complicated. These method