Search results

{{Short description|Task scheduling algorithm}} ...|first3=M. |year=2002 |title=Performance-effective and low-complexity task scheduling for heterogeneous computing |journal=IEEE Transactions on Parallel and Dist ...

...ation Algorithms for Problems in Sequencing, Scheduling, and Communication Network Design ...rkeley]] in 1984. His major focus has been in the design and [[analysis of algorithms]] for discrete optimization problems. ...

Interval edge coloring has wide applications in various fields of science and scheduling. * One of the basic applications of interval edge coloring is the scheduling of the timetable for classes without clashes, in this application the class ...

...on to which all players must connect the price of stability of the Shapely network design game is <math>O(\log n/\log\log n)</math> where <math>n</math> is th ==Network design games== ...

...f optimal control in queueing networks. A typical goal is to stabilize all network queues while optimizing some performance objective, such as minimizing aver [[backpressure routing]] algorithm for network stability, also called the ''max-weight algorithm''.<ref name=tass-radio-ne ...

...in a dynamic network," in Proceedings of 14th Annual ACM Symp. on Parallel Algorithms and Architectures, New York, NY: ACM Press, 2002, pp.&nbsp;41–52. ...en, J. S. Naor, S. Rao, and B. Schieber, "Divide-and-conquer approximation algorithms using spreading metrics," [[Journal of the ACM]], vol. 47, no. 4, pp.&nbsp; ...

...|last1=Kushner|first1=H. J.|title=Convergence of proportional-fair sharing algorithms under general conditions|date=July 2004|journal=IEEE Transactions on Wirele ...

{{Short description|Queue management algorithm for computer network packets}} ..., such as [[router (computing)|router]]s, by setting limits on the delay [[network packet]]s experience as they pass through [[buffer (telecommunication)|buff ...

...multiple service nodes in the network. It is an extension of [[max-weight scheduling]] where each job visits only a single service node. ...sensor network|sensor networks]], mobile ad hoc networks ([[Mobile ad hoc network|MANETS]]), and heterogeneous networks with wireless and wireline components ...

...hniques of [[optimal control]], [[dynamic programming]] and [[flow network|network optimization]]. The study of such models is part of inventory theory. * Several products produced on the same machine: [[Economic lot scheduling problem]] ...

...the '''drift-plus-penalty method''' is used for optimization of [[queueing network]]s and other [[stochastic system]]s. ...stabilizing a queueing network while also minimizing the time average of a network penalty function. It can be used to optimize performance objectives such a ...

...version of the structure has also been applied to [[Scheduling (computing)|scheduling]]<ref name=figueira/> and to [[marching cubes]] in [[computer graphics]].<r ...rXd-gxPhVYC&pg=PA181}}.</ref><ref name=es/><ref name="ms">{{citation|title=Algorithms and Data Structures: The Basic Toolbox|first1=Kurt|last1=Mehlhorn|author1-l ...

...ata, either between levels of memory or between multiple processors over a network. It is much more expensive than arithmetic.<ref name="Demmel_2012"/> A common computational model in analyzing communication-avoiding algorithms is the two-level memory model: ...

...BS|year=2019|title=RideNN: A new rider optimization algorithm based neural network for fault diagnosis of analog circuits|journal=IEEE Transactions on Instrum ...BS|year=2019|title=RideNN: A new rider optimization algorithm based neural network for fault diagnosis of analog circuits|journal=IEEE Transactions on Instrum ...

...o-Boolean function]] <math>f</math>, if it is possible to construct a flow network with positive weights such that * each cut <math>C</math> of the network can be mapped to an assignment of variables <math>\mathbf{x}</math> to <mat ...

...tant applications in finding the [[Critical path method|critical path]] in scheduling problems. ...natorial Optimization: Polyhedra and Efficiency, Volume 1|volume=24|series=Algorithms and Combinatorics|first=Alexander|last=Schrijver|authorlink=Alexander Schri ...

The '''p-Cycle protection''' scheme is a technique to protect a [[mesh network]] from a failure of a link, with the benefits of ring like recovery speed a ...sh like capacity efficiency.<ref name="networks with p-cycle" /> In a mesh network, the spare capacity is used to create the ring like structures as shown in ...

...d the efficiency is some function of the outcomes (e.g. maximum delay in a network, congestion in a transportation system, social welfare in an auction, etc.) ...e.g. delay in a network) we use (following the convention in approximation algorithms): ...

...web | url=https://www.cs.cmu.edu/~arielpro/15896/docs/notes14.pdf | title=Algorithms, Games, and Networks - Lecture 14 | date=February 28, 2013 | access-date=28 ...fferent computers have different transmission speeds, so every edge in the network has a numeric cost equal to the number of milliseconds it takes to transmit ...

...hm''' (LA) is one among the bio-inspired (or) nature-inspired optimization algorithms (or) that are mainly based on meta-heuristic principles. It was first intro ...(ICSEDPS) |chapter=Implementation of Improved Lion Algorithm for Generator Scheduling in Deregulated Power System using IEEE-30 Bus System |year=2018|chapter-url ...