✦ LIBER ✦

An optimal scheduling algorithm for an agent-based multicast strategy on irregular networks

✍ Scribed by Pangfeng Liu; Yi-Fang Lin; Jan-Jan Wu; Zhe-Hao Kang

Publisher: Springer US
Year: 2007
Tongue: English
Weight: 878 KB
Volume: 42
Category: Article
ISSN: 0920-8542
DOI: 10.1007/s11227-007-0116-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An optimal algorithm for preemptive on-l

An optimal algorithm for preemptive on-line scheduling

✍ Bo Chen; André van Vliet; Gerhard J. Woeginger 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 286 KB

An optimizing BP neural network algorith

An optimizing BP neural network algorithm based on genetic algorithm

✍ Shifei Ding; Chunyang Su; Junzhao Yu 📂 Article 📅 2011 🏛 Springer Netherlands 🌐 English ⚖ 298 KB

An optimizing method of RBF neural netwo

An optimizing method of RBF neural network based on genetic algorithm

✍ Shifei Ding; Li Xu; Chunyang Su; Fengxiang Jin 📂 Article 📅 2011 🏛 Springer-Verlag 🌐 English ⚖ 201 KB

An Optimal Algorithm for Scheduling Inte

An Optimal Algorithm for Scheduling Interval Ordered Tasks with Communication on N Processors

✍ H.H. Ali; H. Elrewini 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 506 KB

The problem of scheduling task graphs on multiprocessor systems have received considerable attention in recent years. This problem is known to be NP-hard in its general form as well as many restricted cases. Few polynomial algorithms have been developed for solving special cases of the scheduling pr

An agent-based parallel approach for the

An agent-based parallel approach for the job shop scheduling problem with genetic algorithms

✍ Leila Asadzadeh; Kamran Zamanifar 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 599 KB

An agent-based parallel approach for the

An agent-based parallel approach for the job shop scheduling problem with genetic algorithms

✍ Leila Asadzadeh; Kamran Zamanifar 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 599 KB

The job shop scheduling problem is one of the most important and complicated problems in machine scheduling. This problem is characterized as NP-hard. The high complexity of the problem makes it hard to find the optimal solution within reasonable time in most cases. Hence searching for approximate s